Back to Multiple platform build/check report for BioC 3.20: simplified long |
|
This page was generated on 2024-12-23 12:04 -0500 (Mon, 23 Dec 2024).
Hostname | OS | Arch (*) | R version | Installed pkgs |
---|---|---|---|---|
nebbiolo2 | Linux (Ubuntu 24.04.1 LTS) | x86_64 | 4.4.2 (2024-10-31) -- "Pile of Leaves" | 4744 |
palomino8 | Windows Server 2022 Datacenter | x64 | 4.4.2 (2024-10-31 ucrt) -- "Pile of Leaves" | 4487 |
merida1 | macOS 12.7.5 Monterey | x86_64 | 4.4.2 (2024-10-31) -- "Pile of Leaves" | 4515 |
kjohnson1 | macOS 13.6.6 Ventura | arm64 | 4.4.2 (2024-10-31) -- "Pile of Leaves" | 4467 |
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 1669/2289 | Hostname | OS / Arch | INSTALL | BUILD | CHECK | BUILD BIN | ||||||||
RBGL 1.82.0 (landing page) Bioconductor Package Maintainer
| nebbiolo2 | Linux (Ubuntu 24.04.1 LTS) / x86_64 | OK | OK | WARNINGS | |||||||||
palomino8 | Windows Server 2022 Datacenter / x64 | OK | OK | WARNINGS | OK | |||||||||
merida1 | macOS 12.7.5 Monterey / x86_64 | OK | OK | OK | OK | |||||||||
kjohnson1 | macOS 13.6.6 Ventura / arm64 | OK | OK | OK | OK | |||||||||
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. |
Package: RBGL |
Version: 1.82.0 |
Command: /home/biocbuild/bbs-3.20-bioc/R/bin/R CMD check --install=check:RBGL.install-out.txt --library=/home/biocbuild/bbs-3.20-bioc/R/site-library --timings RBGL_1.82.0.tar.gz |
StartedAt: 2024-12-20 04:34:50 -0500 (Fri, 20 Dec 2024) |
EndedAt: 2024-12-20 04:35:57 -0500 (Fri, 20 Dec 2024) |
EllapsedTime: 67.1 seconds |
RetCode: 0 |
Status: WARNINGS |
CheckDir: RBGL.Rcheck |
Warnings: 1 |
############################################################################## ############################################################################## ### ### Running command: ### ### /home/biocbuild/bbs-3.20-bioc/R/bin/R CMD check --install=check:RBGL.install-out.txt --library=/home/biocbuild/bbs-3.20-bioc/R/site-library --timings RBGL_1.82.0.tar.gz ### ############################################################################## ############################################################################## * using log directory ‘/home/biocbuild/bbs-3.20-bioc/meat/RBGL.Rcheck’ * using R version 4.4.2 (2024-10-31) * using platform: x86_64-pc-linux-gnu * R was compiled by gcc (Ubuntu 13.2.0-23ubuntu4) 13.2.0 GNU Fortran (Ubuntu 13.2.0-23ubuntu4) 13.2.0 * running under: Ubuntu 24.04.1 LTS * using session charset: UTF-8 * checking for file ‘RBGL/DESCRIPTION’ ... OK * this is package ‘RBGL’ version ‘1.82.0’ * checking package namespace information ... OK * checking package dependencies ... OK * checking if this is a source package ... OK * checking if there is a namespace ... OK * checking for hidden files and directories ... OK * checking for portable file names ... OK * checking for sufficient/correct file permissions ... OK * checking whether package ‘RBGL’ can be installed ... WARNING Found the following significant warnings: interfaces.cpp:81:17: warning: catching polymorphic type ‘struct boost::not_a_dag’ by value [-Wcatch-value=] See ‘/home/biocbuild/bbs-3.20-bioc/meat/RBGL.Rcheck/00install.out’ for details. * used C++ compiler: ‘g++ (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ * checking installed package size ... NOTE installed size is 31.1Mb sub-directories of 1Mb or more: libs 28.5Mb old_boost 1.9Mb * checking package directory ... OK * checking ‘build’ directory ... OK * checking DESCRIPTION meta-information ... NOTE Package listed in more than one of Depends, Imports, Suggests, Enhances: ‘methods’ A package should be listed in only one of these fields. * checking top-level files ... OK * checking for left-over files ... OK * checking index information ... OK * checking package subdirectories ... OK * checking code files for non-ASCII characters ... OK * checking R files for syntax errors ... OK * checking whether the package can be loaded ... OK * checking whether the package can be loaded with stated dependencies ... OK * checking whether the package can be unloaded cleanly ... OK * checking whether the namespace can be loaded with stated dependencies ... OK * checking whether the namespace can be unloaded cleanly ... OK * checking loading without being on the library search path ... OK * checking dependencies in R code ... OK * checking S3 generic/method consistency ... OK * checking replacement functions ... OK * checking foreign function calls ... OK * checking R code for possible problems ... OK * checking Rd files ... NOTE checkRd: (-1) maxClique.Rd:16: Lost braces 16 | only to be supplied if code{g} is not} | ^ checkRd: (-1) tsort.Rd:20: Escaped LaTeX specials: \_ * checking Rd metadata ... OK * checking Rd cross-references ... OK * checking for missing documentation entries ... OK * checking for code/documentation mismatches ... OK * checking Rd \usage sections ... OK * checking Rd contents ... OK * checking for unstated dependencies in examples ... OK * checking contents of ‘data’ directory ... OK * checking data for non-ASCII characters ... OK * checking data for ASCII and uncompressed saves ... OK * checking line endings in C/C++/Fortran sources/headers ... OK * checking compiled code ... NOTE Note: information on .o files is not available File ‘/home/biocbuild/bbs-3.20-bioc/R/site-library/RBGL/libs/RBGL.so’: Found ‘abort’, possibly from ‘abort’ (C) Compiled code should not call entry points which might terminate R nor write to stdout/stderr instead of to the console, nor use Fortran I/O nor system RNGs nor [v]sprintf. The detected symbols are linked into the code but might come from libraries and not actually be called. See ‘Writing portable packages’ in the ‘Writing R Extensions’ manual. * checking installed files from ‘inst/doc’ ... OK * checking files in ‘vignettes’ ... OK * checking examples ... OK * checking for unstated dependencies in ‘tests’ ... OK * checking tests ... Running ‘runTests.R’ OK * checking for unstated dependencies in vignettes ... OK * checking package vignettes ... OK * checking re-building of vignette outputs ... OK * checking PDF version of manual ... OK * DONE Status: 1 WARNING, 4 NOTEs See ‘/home/biocbuild/bbs-3.20-bioc/meat/RBGL.Rcheck/00check.log’ for details.
RBGL.Rcheck/00install.out
############################################################################## ############################################################################## ### ### Running command: ### ### /home/biocbuild/bbs-3.20-bioc/R/bin/R CMD INSTALL RBGL ### ############################################################################## ############################################################################## * installing to library ‘/home/biocbuild/bbs-3.20-bioc/R/site-library’ * installing *source* package ‘RBGL’ ... ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0’ g++ -std=gnu++17 -I"/home/biocbuild/bbs-3.20-bioc/R/include" -DNDEBUG -I'/home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include' -I/usr/local/include -fpic -g -O2 -Wall -c bbc.cpp -o bbc.o In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:22, from RBGL.hpp:17, from bbc.cpp:1: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:598: /home/biocbuild/bbs-3.20-bioc/R/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 /usr/include/c++/13/memory:78, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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 ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/scoped_ptr.hpp:13, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/biocbuild/bbs-3.20-bioc/R/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() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/assert.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:19: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:31, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:20: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/utility/base_from_member.hpp:15, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >&]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/betweenness_centrality.hpp:15, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/bc_clustering.hpp:13, from bbc.cpp:37: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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&> > >’ /home/biocbuild/bbs-3.20-bioc/R/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&> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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&> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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&> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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&> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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&> > >’ /home/biocbuild/bbs-3.20-bioc/R/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&> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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&> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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&>]’ /home/biocbuild/bbs-3.20-bioc/R/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&>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ bbc.cpp:149:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ bbc.cpp:67:33: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/home/biocbuild/bbs-3.20-bioc/R/include" -DNDEBUG -I'/home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include' -I/usr/local/include -fpic -g -O2 -Wall -c cliques.cpp -o cliques.o In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:22, from RBGL.hpp:17, from cliques.cpp:1: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:598: /home/biocbuild/bbs-3.20-bioc/R/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 /usr/include/c++/13/memory:78, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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 ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/scoped_ptr.hpp:13, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/biocbuild/bbs-3.20-bioc/R/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() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/home/biocbuild/bbs-3.20-bioc/R/include" -DNDEBUG -I'/home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include' -I/usr/local/include -fpic -g -O2 -Wall -c clusteringCoef.cpp -o clusteringCoef.o In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:22, from RBGL.hpp:17, from clusteringCoef.cpp:1: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:598: /home/biocbuild/bbs-3.20-bioc/R/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 /usr/include/c++/13/memory:78, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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 ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/scoped_ptr.hpp:13, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/biocbuild/bbs-3.20-bioc/R/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() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/home/biocbuild/bbs-3.20-bioc/R/include" -DNDEBUG -I'/home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include' -I/usr/local/include -fpic -g -O2 -Wall -c dominatorTree.cpp -o dominatorTree.o In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:22, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:598: /home/biocbuild/bbs-3.20-bioc/R/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 /usr/include/c++/13/memory:78, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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 ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/scoped_ptr.hpp:13, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/biocbuild/bbs-3.20-bioc/R/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() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/assert.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:19: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:31, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:20: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/utility/base_from_member.hpp:15, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:545:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:573:11: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/dominator_tree.hpp:15, from dominatorTree.cpp:2: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*&]’ dominatorTree.cpp:44:40: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<void*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<void*>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<void*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<void*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<void*>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<void*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<void*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<void*>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*> >&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*> >&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*> >&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*> >&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*> >&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*> >&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*> >&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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*> >&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<void*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<void*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<void*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<void*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<void*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> >’ /home/biocbuild/bbs-3.20-bioc/R/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*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> >’ /home/biocbuild/bbs-3.20-bioc/R/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*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*> >&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*> >&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*> >&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*> >&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*> >&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*> >&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*> >&]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ dominatorTree.cpp:46:36: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/home/biocbuild/bbs-3.20-bioc/R/include" -DNDEBUG -I'/home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include' -I/usr/local/include -fpic -g -O2 -Wall -c edmonds_optimum_branching.cpp -o edmonds_optimum_branching.o In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:22, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:598: /home/biocbuild/bbs-3.20-bioc/R/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 /usr/include/c++/13/memory:78, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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 ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/scoped_ptr.hpp:13, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/biocbuild/bbs-3.20-bioc/R/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() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | 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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/assert.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:19: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:31, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:20: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/utility/base_from_member.hpp:15, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’ /home/biocbuild/bbs-3.20-bioc/R/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*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’ /home/biocbuild/bbs-3.20-bioc/R/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*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’ /home/biocbuild/bbs-3.20-bioc/R/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*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’ /home/biocbuild/bbs-3.20-bioc/R/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*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ 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> > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/home/biocbuild/bbs-3.20-bioc/R/include" -DNDEBUG -I'/home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include' -I/usr/local/include -fpic -g -O2 -Wall -c hcs.cpp -o hcs.o In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:22, from RBGL.hpp:17, from hcs.cpp:1: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:598: /home/biocbuild/bbs-3.20-bioc/R/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 /usr/include/c++/13/memory:78, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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 ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/scoped_ptr.hpp:13, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/biocbuild/bbs-3.20-bioc/R/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() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/assert.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:19: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:31, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:20: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/utility/base_from_member.hpp:15, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:22, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edge_connectivity.hpp:20, from mincut.hpp:4, from hcs.cpp:2: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ hcs.cpp:299:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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 /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/tuple/tuple.hpp:28, from /home/biocbuild/bbs-3.20-bioc/R/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>::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:64:19: /home/biocbuild/bbs-3.20-bioc/R/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; | ~~~~~~~~~~~^~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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 /usr/include/c++/13/string:51, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/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 /usr/include/c++/13/bits/stl_algobase.h:506:30, inlined from ‘_OI std::__copy_move_a1(_II, _II, _OI) [with bool _IsMove = false; _II = const int*; _OI = int*]’ at /usr/include/c++/13/bits/stl_algobase.h:533: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 /usr/include/c++/13/bits/stl_algobase.h:540:31, inlined from ‘_OI std::copy(_II, _II, _OI) [with _II = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _OI = int*]’ at /usr/include/c++/13/bits/stl_algobase.h:633: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 /usr/include/c++/13/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 /usr/include/c++/13/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 /usr/include/c++/13/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 /usr/include/c++/13/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 /usr/include/c++/13/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 /usr/include/c++/13/bits/alloc_traits.h:538: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 /usr/include/c++/13/bits/stl_vector.h:1286:30, inlined from ‘void HCS_internal(const Graph_ud&, V_Label&, ClusterResult&)’ at hcs.cpp:310:27: /usr/include/c++/13/bits/stl_algobase.h:437:30: warning: ‘void* __builtin_memmove(void*, const void*, long unsigned int)’ forming offset 4 is out of the bounds [0, 4] [-Warray-bounds=] 437 | __builtin_memmove(__result, __first, sizeof(_Tp) * _Num); | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/home/biocbuild/bbs-3.20-bioc/R/include" -DNDEBUG -I'/home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include' -I/usr/local/include -fpic -g -O2 -Wall -c incrConnComp.cpp -o incrConnComp.o In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:22, from RBGL.hpp:17, from incrConnComp.cpp:1: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:598: /home/biocbuild/bbs-3.20-bioc/R/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 /usr/include/c++/13/memory:78, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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 ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/scoped_ptr.hpp:13, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/biocbuild/bbs-3.20-bioc/R/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() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | 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/bbs-3.20-bioc/R/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) | ^~~ g++ -std=gnu++17 -I"/home/biocbuild/bbs-3.20-bioc/R/include" -DNDEBUG -I'/home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include' -I/usr/local/include -fpic -g -O2 -Wall -c interfaces.cpp -o interfaces.o In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:22, from RBGL.hpp:17, from interfaces.cpp:1: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:598: /home/biocbuild/bbs-3.20-bioc/R/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 /usr/include/c++/13/memory:78, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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 ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/scoped_ptr.hpp:13, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/biocbuild/bbs-3.20-bioc/R/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() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | 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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/assert.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:19: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<int*, long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:31, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:20: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<int*, long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/utility/base_from_member.hpp:15, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<int*, long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<dfs_time_visitor<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:545:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:573:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:71:29: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:113:29: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:113:29: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<dfs_time_visitor<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::components_recorder<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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<>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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<>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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<>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:370:56: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:71:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:71:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<bfs_time_visitor<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:113:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:113:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:113:29: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:113:29: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:113:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:113:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::components_recorder<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:232:26: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<long unsigned int, long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:232:26: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:232:26: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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<>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:264:47: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:71:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<bfs_time_visitor<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:113:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:113:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:113:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:113:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<int*, long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:232:26: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<long unsigned int, long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:232:26: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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<>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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<>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:113:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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<>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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<>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:205:29: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/strong_components.hpp:129:27: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:232:26: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/biconnected_components.hpp:211:27: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:264:47: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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<> > >’ /home/biocbuild/bbs-3.20-bioc/R/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<> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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<> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:158:27: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:232:26: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:232:26: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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<> > >’ /home/biocbuild/bbs-3.20-bioc/R/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<> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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<> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:264:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:264:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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<> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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<> > >’ /home/biocbuild/bbs-3.20-bioc/R/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<> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ interfaces.cpp:300:28: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:326:34: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:232:26: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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<> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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<> > >’ /home/biocbuild/bbs-3.20-bioc/R/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<> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ interfaces.cpp:264:47: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/tuple/tuple.hpp:28, from /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edge_connectivity.hpp:130:26: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edge_connectivity.hpp:34:44: note: ‘p’ was declared here 34 | typename Traits::vertex_descriptor p; | ^ g++ -std=gnu++17 -I"/home/biocbuild/bbs-3.20-bioc/R/include" -DNDEBUG -I'/home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include' -I/usr/local/include -fpic -g -O2 -Wall -c minST.cpp -o minST.o In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:22, from RBGL.hpp:17, from minST.cpp:1: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:598: /home/biocbuild/bbs-3.20-bioc/R/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 /usr/include/c++/13/memory:78, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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 ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/scoped_ptr.hpp:13, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/biocbuild/bbs-3.20-bioc/R/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() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | 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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/assert.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:19: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:31, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:20: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/utility/base_from_member.hpp:15, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<double>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept<double>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ComparableConcept<double> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ComparableConcept<double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ComparableConcept<double>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:251:3: note: in expansion of macro ‘BOOST_concept’ 251 | BOOST_concept(Comparable,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<long unsigned int, long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:70:3: note: in expansion of macro ‘BOOST_concept’ 70 | BOOST_concept(Integer, (T)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<double>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept<double>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ComparableConcept<double> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ComparableConcept<double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ComparableConcept<double>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<long unsigned int, long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:545:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:573:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::forward_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:20:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >]’ minST.cpp:54:38: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:15, from minST.cpp:3: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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&]’ /home/biocbuild/bbs-3.20-bioc/R/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&>]’ /home/biocbuild/bbs-3.20-bioc/R/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&>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ minST.cpp:89:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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 /usr/include/c++/13/string:48, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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: /usr/include/c++/13/bits/stl_iterator.h:1228: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] 1228 | { return __lhs.base() == __rhs.base(); } | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~ In file included from minST.cpp:2: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp: In function ‘SEXPREC* BGL_KMST_D(SEXP, SEXP, SEXP, SEXP)’: /home/biocbuild/bbs-3.20-bioc/R/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; | ^~~~~ g++ -std=gnu++17 -I"/home/biocbuild/bbs-3.20-bioc/R/include" -DNDEBUG -I'/home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include' -I/usr/local/include -fpic -g -O2 -Wall -c mincut.cpp -o mincut.o In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:22, from RBGL.hpp:17, from mincut.cpp:1: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:598: /home/biocbuild/bbs-3.20-bioc/R/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 /usr/include/c++/13/memory:78, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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 ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/scoped_ptr.hpp:13, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/biocbuild/bbs-3.20-bioc/R/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() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/assert.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:19: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:31, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:20: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/utility/base_from_member.hpp:15, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:22, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edge_connectivity.hpp:20, from mincut.hpp:4, from mincut.cpp:2: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> > > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_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<iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_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<iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_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<iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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::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>&>, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_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<iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_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<iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_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<iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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::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>&>, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_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<iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_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<iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_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<iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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::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>&>, boost::on_tree_edge> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<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>&>, boost::on_tree_edge> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<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>&>, boost::on_tree_edge> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::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>&>, boost::on_tree_edge> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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::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>&>, boost::on_tree_edge> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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::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>&>, boost::on_tree_edge> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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::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>&>, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-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::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>&>, boost::on_tree_edge> > >]’: /home/biocbuild/bbs-3.20-bioc/R/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::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>&>, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::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>&>, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/biocbuild/bbs-3.20-bioc/R/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::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>&>, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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::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>&>, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/biocbuild/bbs-3.20-bioc/R/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::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>&>, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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::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>&>, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/biocbuild/bbs-3.20-bioc/R/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::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/biocbuild/bbs-3.20-bioc/R/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::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/biocbuild/bbs-3.20-bioc/R/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::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/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::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/biocbuild/bbs-3.20-bioc/R/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::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/biocbuild/bbs-3.20-bioc/R/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::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/biocbuild/bbs-3.20-bioc/R/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::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/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::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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::no_property, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_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<iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_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<iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_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<iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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::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>&>, boost::on_tree_edge> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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::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>&>, boost::on_tree_edge> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<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>&>, boost::on_tree_edge> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<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>&>, boost::on_tree_edge> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::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>&>, boost::on_tree_edge> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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::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>&>, boost::on_tree_edge> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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::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>&>, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/biocbuild/bbs-3.20-bioc/R/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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >, is_residual_edge<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_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<iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>, on_tree_edge> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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*]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ 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]’ mincut.cpp:128:35: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; CapacityEdgeMap = 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>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, 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_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, const detail::edge_desc_impl<directed_tag, long unsigned int>&, 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_reverse_t>; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, default_color_type, default_color_type&>; PredEdgeMap = iterator_property_map<__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> > > >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: 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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/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]’ mincut.cpp:76:45: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_capacity_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> > > >, 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, 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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/13/string:48, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/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_capacity_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> > > > >*; _Container = std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > >]’, 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_capacity_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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, 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_capacity_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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >; 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_capacity_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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, 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_capacity_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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >; 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/bbs-3.20-bioc/R/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_capacity_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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, 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_capacity_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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’ at /home/biocbuild/bbs-3.20-bioc/R/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_capacity_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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, 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_capacity_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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, 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/bbs-3.20-bioc/R/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_capacity_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> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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> > > > > > > >, 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::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> > > > >]’ at /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/detail/adj_list_edge_iterator.hpp:113:25, inlined from ‘SEXPREC* BGL_max_flow_internal(SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, E_MF_METHOD)’ at mincut.cpp:101:45: /usr/include/c++/13/bits/stl_iterator.h:1228:27: warning: ‘*(boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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>, boost::no_property> > > >* const*)((char*)&e_end + 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_capacity_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>, boost::no_property> > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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>, boost::no_property> > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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>, 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::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>, 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_capacity_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>, boost::no_property> > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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>, boost::no_property> > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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>, 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_capacity_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>, boost::no_property> > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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>, boost::no_property> > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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>, 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_capacity_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>, boost::no_property> > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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>, boost::no_property> > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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>, 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_capacity_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>, boost::no_property> > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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>, boost::no_property> > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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>, 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_capacity_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>, boost::no_property> > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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>, boost::no_property> > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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>, 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_capacity_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>, boost::no_property> > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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>, boost::no_property> > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_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>, 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] 1228 | { return __lhs.base() == __rhs.base(); } | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~ mincut.cpp: In function ‘SEXPREC* BGL_max_flow_internal(SEXP, SEXP, SEXP, SEXP, SEXP, SEXP, E_MF_METHOD)’: mincut.cpp:99:23: note: ‘e_end’ declared here 99 | edge_iterator ei, e_end; | ^~~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/tuple/tuple.hpp:28, from /home/biocbuild/bbs-3.20-bioc/R/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>::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> >]’ at mincut.hpp:64:19: /home/biocbuild/bbs-3.20-bioc/R/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; | ~~~~~~~~~~~^~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/edge_connectivity.hpp:34:44: note: ‘p’ was declared here 34 | typename Traits::vertex_descriptor p; | ^ g++ -std=gnu++17 -I"/home/biocbuild/bbs-3.20-bioc/R/include" -DNDEBUG -I'/home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include' -I/usr/local/include -fpic -g -O2 -Wall -c ordering.cpp -o ordering.o In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:22, from RBGL.hpp:17, from ordering.cpp:1: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:598: /home/biocbuild/bbs-3.20-bioc/R/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 /usr/include/c++/13/memory:78, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23: /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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() | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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 ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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 ); | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/scoped_ptr.hpp:13, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/biocbuild/bbs-3.20-bioc/R/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() ) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/bind/mem_fn.hpp:23, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/bind/bind.hpp:23, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/king_ordering.hpp:18, from ordering.cpp:9: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p) | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here 65 | template<typename> class auto_ptr; | ^~~~~~~~ ordering.cpp: In function ‘SEXPREC* BGL_min_degree_ordering(SEXP, SEXP, SEXP, SEXP)’: ordering.cpp:133:67: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs] 133 | typedef graph_traits<Graph_dd>::vertex_descriptor Vertex; | ^~~~~~ ordering.cpp: In function ‘SEXPREC* BGL_king_ordering(SEXP, SEXP, SEXP, SEXP)’: ordering.cpp:182:62: warning: variable ‘id’ set but not used [-Wunused-but-set-variable] 182 | property_map<Graph_dd, vertex_index_t>::type id = get(vertex_index, g); | ^~ ordering.cpp:176:67: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs] 176 | typedef graph_traits<Graph_dd>::vertex_descriptor Vertex; | ^~~~~~ ordering.cpp: In function ‘SEXPREC* BGL_sloan_ordering(SEXP, SEXP, SEXP, SEXP, SEXP)’: ordering.cpp:232:61: warning: typedef ‘Pair’ locally defined but not used [-Wunused-local-typedefs] 232 | typedef std::pair<std::size_t, std::size_t> Pair; | ^~~~ In file included from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/assert.hpp:35, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:19: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:31, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:20: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/utility/base_from_member.hpp:15, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/utility.hpp:15, from RBGL.hpp:16: /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:116:60: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:116:60: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:116:60: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:116:60: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:116:60: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:116:60: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:116:60: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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 = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:116:60: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<int*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:142:30: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<int*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:142:30: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<int*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:142:30: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<int*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:142:30: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<int*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:142:30: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<int*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:142:30: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<int*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:142:30: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-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<int*>]’: /home/biocbuild/bbs-3.20-bioc/R/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 = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:142:30: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<int*>::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter<long unsigned int, long unsigned int, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl<R_adjacency_list<boost::directedS, double>, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9: required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; DegreeMap = iterator_property_map<int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = iterator_property_map<int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:141:26: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:116:60: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:116:60: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:116:60: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:116:60: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:116:60: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:116:60: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<long unsigned int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = long unsigned int*; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:116:60: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<int*>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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<int*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<int*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:142:30: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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 = int*]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<int*>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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<int*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<int*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:142:30: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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 = int*]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<int*>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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<int*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<int*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:142:30: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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 = int*]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<int*>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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<int*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<int*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:142:30: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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 = int*]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<int*>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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<int*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<int*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:142:30: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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 = int*]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<int*>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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<int*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<int*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:142:30: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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 = int*]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<int*>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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<int*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<int*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<int*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<int*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<int*>)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = int*; Value = int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:142:30: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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 = int*]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter<long unsigned int, long unsigned int, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl<R_adjacency_list<boost::directedS, double>, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9: required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; DegreeMap = iterator_property_map<int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = iterator_property_map<int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:141:26: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter<long unsigned int, long unsigned int, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl<R_adjacency_list<boost::directedS, double>, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9: required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; DegreeMap = iterator_property_map<int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = iterator_property_map<int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:141:26: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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 = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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<>, R_adjacency_list<boost::undirectedS, double> >]’: /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:16, from ordering.cpp:2: /home/biocbuild/bbs-3.20-bioc/R/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<>; Graph = R_adjacency_list<boost::undirectedS, double>]’ 39 | void constraints() | ^~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’: /home/biocbuild/bbs-3.20-bioc/R/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::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter<long unsigned int, long unsigned int, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl<R_adjacency_list<boost::directedS, double>, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map<int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/minimum_degree_ordering.hpp:752:9: required from ‘void boost::minimum_degree_ordering(Graph&, DegreeMap, InversePermutationMap, PermutationMap, SuperNodeMap, int, VertexIndexMap) [with Graph = R_adjacency_list<directedS, double>; DegreeMap = iterator_property_map<int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = iterator_property_map<int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, int, int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’ ordering.cpp:141:26: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:545:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:573:11: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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*> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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::undirectedS, boost::property<boost::vertex_index_t, int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/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::undirectedS, boost::property<boost::vertex_index_t, int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:454:17: note: in a call to non-static member function ‘boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>::~AdaptableUnaryFunctionConcept()’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:454:3: note: in expansion of macro ‘BOOST_concept’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:588:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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<> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::dfs_visitor<> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::dfs_visitor<> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<> >]’ /home/biocbuild/bbs-3.20-bioc/R/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<> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::dfs_visitor<> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::dfs_visitor<>, R_adjacency_list<boost::undirectedS, double> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::dfs_visitor<>, R_adjacency_list<boost::undirectedS, double> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-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<> >]’: /home/biocbuild/bbs-3.20-bioc/R/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<>; Graph = R_adjacency_list<boost::undirectedS, double>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<>, R_adjacency_list<boost::undirectedS, double> >]’ /home/biocbuild/bbs-3.20-bioc/R/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<>, R_adjacency_list<boost::undirectedS, double> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::dfs_visitor<>, R_adjacency_list<boost::undirectedS, double> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::dfs_visitor<>, R_adjacency_list<boost::undirectedS, double> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::dfs_visitor<> >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/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::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/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::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/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::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/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::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >, R_adjacency_list<boost::undirectedS, double> >]’: /home/biocbuild/bbs-3.20-bioc/R/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 = sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, degree_property_map<R_adjacency_list<undirectedS, double> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; Buffer = sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, degree_property_map<R_adjacency_list<undirectedS, double> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque<typename graph_traits<Graph>::vertex_descriptor, std::allocator<typename graph_traits<Graph>::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/detail/sparse_ordering.hpp:20, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:15, from ordering.cpp:3: /home/biocbuild/bbs-3.20-bioc/R/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::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >; Graph = R_adjacency_list<boost::undirectedS, double>]’ 37 | void constraints() | ^~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/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*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >; Value = void*; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>]’ ordering.cpp:69:31: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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::undirectedS, boost::property<boost::vertex_index_t, int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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::undirectedS, boost::property<boost::vertex_index_t, int> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/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::undirectedS, boost::property<boost::vertex_index_t, int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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::undirectedS, boost::property<boost::vertex_index_t, int> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::UnaryFunction<Func, Return, Arg>::~UnaryFunction() [with Func = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Return = long unsigned int; Arg = void*]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:321:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 321 | BOOST_CONCEPT_USAGE(UnaryFunction) { test(is_void<Return>()); } | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’: /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’: /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >’ /home/biocbuild/bbs-3.20-bioc/R/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<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:588:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; Key = void*]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*>]’ /home/biocbuild/bbs-3.20-bioc/R/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_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:588:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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 = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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 = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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 = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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 = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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 = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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 = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/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> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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 = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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 = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/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>)>’ /home/biocbuild/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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 = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/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>]’ /home/biocbuild/bbs-3.20-bioc/R/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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 = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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<> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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<> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::dfs_visitor<> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::dfs_visitor<> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<> >]’ /home/biocbuild/bbs-3.20-bioc/R/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<> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::dfs_visitor<>, R_adjacency_list<boost::undirectedS, double> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::dfs_visitor<>, R_adjacency_list<boost::undirectedS, double> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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<>]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/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::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/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::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/biocbuild/bbs-3.20-bioc/R/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::undirectedS, double>; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, 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>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; DFSVisitor = dfs_visitor<>; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:146:30: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >, R_adjacency_list<boost::undirectedS, double> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, degree_property_map<R_adjacency_list<undirectedS, double> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; Buffer = sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, degree_property_map<R_adjacency_list<undirectedS, double> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque<typename graph_traits<Graph>::vertex_descriptor, std::allocator<typename graph_traits<Graph>::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-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::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >; Graph = R_adjacency_list<boost::undirectedS, double>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >, R_adjacency_list<boost::undirectedS, double> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >, R_adjacency_list<boost::undirectedS, double> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >, R_adjacency_list<boost::undirectedS, double> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > >, R_adjacency_list<boost::undirectedS, double> >)>’ /home/biocbuild/bbs-3.20-bioc/R/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 = sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, degree_property_map<R_adjacency_list<undirectedS, double> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; SourceIterator = long unsigned int*]’ /home/biocbuild/bbs-3.20-bioc/R/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 = R_adjacency_list<undirectedS, double>; Buffer = sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, degree_property_map<R_adjacency_list<undirectedS, double> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque<typename graph_traits<Graph>::vertex_descriptor, std::allocator<typename graph_traits<Graph>::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/cuthill_mckee_ordering.hpp:157:34: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >; ColorMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>, adjacency_list<vecS, vecS, undirectedS, property<vertex_color_t, default_color_type>, property<edge_weight_t, double, no_property>, no_property, listS>*, default_color_type, default_color_type&, vertex_color_t>; DegreeMap = degree_property_map<R_adjacency_list<undirectedS, double> >]’ ordering.cpp:98:25: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::bfs_rcm_visitor<std::reverse_iterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >, boost::sparse::sparse_ordering_queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >, boost::degree_property_map<R_adjacency_list<boost::undirectedS, double> > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/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<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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 = std::_List_iterator<void*>]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/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<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:562:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/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<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’ /home/biocbuild/bbs-3.20-bioc/R/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<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/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<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/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<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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<void*, boost::no_property> >, boost::detail::edge_desc_impl<boost::undirected_tag, void*>, long int>]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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, void*> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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, void*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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, void*> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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, void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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, void*> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-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, void*> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/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<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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, void*>]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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, void*> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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, void*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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, void*> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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, void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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, void*> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-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, void*> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/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<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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, void*>]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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, void*> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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, void*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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, void*> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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, void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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, void*> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-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, void*> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/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<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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, void*>]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/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<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/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<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:563:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<long unsigned int, long unsigned int>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<long unsigned int, long unsigned int> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<long unsigned int, long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-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<long unsigned int, long unsigned int>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:450:11: required from ‘boost::AdaptableUnaryFunction<Func, Return, Arg>::~AdaptableUnaryFunction() [with Func = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Return = long unsigned int; Arg = void*]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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<void*, void*> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<void*, void*>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void*, void*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<void*, void*> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<void*, void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<void*, void*>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-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<void*, void*>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:463:11: required from ‘boost::AdaptableUnaryFunction<Func, Return, Arg>::~AdaptableUnaryFunction() [with Func = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Return = long unsigned int; Arg = void*]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AdaptableUnaryFunctionConcept<boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, long unsigned int, void*>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:577:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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 = void*; Y = void*]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/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> >]’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/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>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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>]’ /home/biocbuild/bbs-3.20-bioc/R/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’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:588:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/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<char*, std::vector<char> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<char*, std::vector<char> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<char*, std::vector<char> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<char*, std::vector<char> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<char*, std::vector<char> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<char*, std::vector<char> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<char*, std::vector<char> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<char*, std::vector<char> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<char*, std::vector<char> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<char*, std::vector<char> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<char*, std::vector<char> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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<char*, std::vector<char> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<char*, std::vector<char> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<char*, std::vector<char> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<char*, std::vector<char> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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<char*, std::vector<char> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<char*, std::vector<char> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<char*, std::vector<char> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<char*, std::vector<char> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<char*, std::vector<char> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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<char*, std::vector<char> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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<char*, std::vector<char> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<char*, std::vector<char> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-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<char*, std::vector<char> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::safe_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_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator<char*, std::vector<char> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = char; typename std::iterator_traits< <template-parameter-1-1> >::reference = char&; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:155:51: required from ‘boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:603:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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<char*, std::vector<char> > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-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::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/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> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:152:13: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-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::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<const long unsigned int*, std::vector<long unsigned int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<const long unsigned int*, std::vector<long unsigned int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:281:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<long unsigned int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<long unsigned int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:191:13: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-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::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:191:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:322:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:218:14: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-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::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:218:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:356:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:239:14: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-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::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:239:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/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::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:374:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&) [with RandomAccessRange = std::vector<long unsigned int>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:206:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/range/size_type.hpp:20, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/size.hpp:21, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/functions.hpp:20, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/iterator_range_core.hpp:38, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/iterator_range.hpp:13, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/irange.hpp:16, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/detail/adjacency_list.hpp:21, from /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/adjacency_list.hpp:255: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept<std::vector<long unsigned int> >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept<T> | ^~~~~~~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<const std::vector<long unsigned int> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept<const std::vector<long unsigned int> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::SinglePassRangeConcept<const std::vector<long unsigned int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::vector<long unsigned int> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::vector<long unsigned int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:213:23: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<const std::vector<long unsigned int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SinglePassRangeConcept<const std::vector<long unsigned int> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘bool boost::range::equal(const SinglePassRange1&, const SinglePassRange2&) [with SinglePassRange1 = std::vector<long unsigned int>; SinglePassRange2 = std::vector<long unsigned int>]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:213:23: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = const std::vector<long unsigned int>]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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* const*, std::vector<void*> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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* const*, std::vector<void*> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:281:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void* const*, std::vector<void*> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<void*> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<void*> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:322:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void* const*, std::vector<void*> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:356:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void* const*, std::vector<void*> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >)>’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:374:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void* const*, std::vector<void*> > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept<std::vector<void*> >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >::value’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<void*> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<void* const*, std::vector<void*> >]’ 37 | ~model() | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessRangeConcept<std::vector<void*> >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<void*>; BinaryPredicate = boost::detail::isomorphism_algo<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > > >::compare_multiplicity]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:220:17: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept<std::vector<void*> >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept<T> | ^~~~~~~~~~~~~~~~~~~~~~~~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*, std::vector<int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*, std::vector<int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*, std::vector<int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*, std::vector<int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*, std::vector<int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*, std::vector<int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*, std::vector<int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<int*, std::vector<int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Param1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = bool]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:738:1: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const bgl_named_params<P, T, R>&) [with Param0 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Param1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; P = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; T = vertex_isomorphism_t; R = no_property; typename result_of<graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type&)>::type = bool; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<P, T, R> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::isomorphism_map, const iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’ ordering.cpp:68:18: required from here /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*, std::vector<int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/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<int*, std::vector<int> > > >]’: /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<int*, std::vector<int> > >’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<int*, std::vector<int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/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<int*, std::vector<int> > > >::value’ /home/biocbuild/bbs-3.20-bioc/R/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/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:243:54: required from ‘bool boost::detail::isomorphism_algo<Graph1, Graph2, IsoMapping, Invariant1, Invariant2, IndexMap1, IndexMap2, InvariantCountMap>::test_isomorphism() [with Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; IsoMapping = 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; Invariant2 = boost::degree_vertex_invariant<boost::shared_array_property_map<long unsigned int, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> > >; IndexMap1 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; InvariantCountMap = boost::unordered::unordered_flat_map<long unsigned int, long unsigned int, boost::hash<long unsigned int>, std::equal_to<long unsigned int>, std::allocator<std::pair<const long unsigned int, long unsigned int> > >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:605:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; Graph2 = adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >; IsoMapping = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, int&, vertex_index_t>, void*, void*&>; Invariant1 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; Invariant2 = degree_vertex_invariant<shared_array_property_map<long unsigned int, adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t> >, adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> > >; IndexMap1 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; IndexMap2 = adj_list_vertex_property_map<adjacency_list<vecS, listS, undirectedS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; std::size_t = long unsigned int]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:723:42: required from ‘bool boost::graph::detail::isomorphism_impl<Graph1, Graph2>::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::isomorphism_map, const 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::undirectedS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph1 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::listS, boost::undirectedS, boost::property<boost::vertex_index_t, int> >]’ /home/biocbuild/bbs-3.20-bioc/R/site-library/BH/include/boost/graph/isomorphism.hpp:734:5: required from ‘typename boost::result_of<boost::graph::detail::isomorphism_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&