* installing *source* package ‘TBRDist’ ...
** package ‘TBRDist’ successfully unpacked and MD5 sums checked
** using staged installation
** libs
using C++ compiler: ‘g++-14 (GCC) 14.2.0’
using C++11
make[1]: Entering directory '/data/gannet/ripley/R/packages/tests-devel/TBRDist/src'
g++-14 -std=gnu++11 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I/usr/local/include -DC99_INLINE_SEMANTICS=0 -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -DR_NO_REMAP -c RcppExports.cpp -o RcppExports.o
g++-14 -std=gnu++11 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I/usr/local/include -DC99_INLINE_SEMANTICS=0 -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -DR_NO_REMAP -c uspr.cpp -o uspr.o
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/scoped_ptr.hpp:13,
from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:22,
from uspr/tbr.h:44,
from uspr.cpp:18:
/data/gannet/ripley/R/test-dev/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 ) BOOST_SP_NOEXCEPT : px( p.release() )
| ^~~~~~~~
In file included from /usr/local/gcc14/include/c++/14.2.0/memory:78,
from uspr.cpp:12:
/usr/local/gcc14/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:18,
from /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/vector_property_map.hpp:14,
from /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:598,
from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:27:
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
361 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
| ^~~~~~~~
/usr/local/gcc14/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R >
| ^~~~~~~~
/usr/local/gcc14/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
508 | explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
| ^~~~~~~~
/usr/local/gcc14/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
521 | shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
| ^~~~~~~~
/usr/local/gcc14/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
604 | shared_ptr & operator=( std::auto_ptr<Y> & r )
| ^~~~~~~~
/usr/local/gcc14/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
613 | shared_ptr & operator=( std::auto_ptr<Y> && r )
| ^~~~~~~~
/usr/local/gcc14/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
615 | this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
| ^~~~~~~~
/usr/local/gcc14/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/concept/assert.hpp:35,
from /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:19:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::odd_components_counter<long unsigned int>, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:130:9: required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter<long unsigned int>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: required from 'void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::odd_components_counter<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
397 | boost::depth_first_search(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())],
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
400 | arg_pack[_root_vertex
| ~~~~~~~~~~~~~~~~~~~~~
401 | || boost::detail::get_default_starting_vertex_t<
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
402 | Graph >(g)]);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >; 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::no_property, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::odd_components_counter<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:21,
from uspr/tbr.h:45:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function 'void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::odd_components_counter<long unsigned int>; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
39 | void constraints()
| ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::odd_components_counter<long unsigned int> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<boost::detail::odd_components_counter<long unsigned int> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:165:3: required from 'struct boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> >'
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/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 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:31,
from /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:20:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::odd_components_counter<long unsigned int> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:41:9: required from 'void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::odd_components_counter<long unsigned int>; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::detail::odd_components_counter<long unsigned int>, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::odd_components_counter<long unsigned int>, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::odd_components_counter<long unsigned int>, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::detail::odd_components_counter<long unsigned int>, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22,
from /data/gannet/ripley/R/test-dev/BH/include/boost/mpl/int.hpp:20,
from /data/gannet/ripley/R/test-dev/BH/include/boost/mpl/lambda_fwd.hpp:23,
from /data/gannet/ripley/R/test-dev/BH/include/boost/mpl/aux_/na_spec.hpp:18,
from /data/gannet/ripley/R/test-dev/BH/include/boost/mpl/if.hpp:19,
from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_traits.hpp:17,
from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:24:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function 'boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> >::~CopyConstructibleConcept()'
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro 'BOOST_concept'
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > > >]':
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >'
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >'
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > > >]':
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >'
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:129:9: required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter<long unsigned int>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter<long unsigned int>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]'
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: required from 'void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::odd_components_counter<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
397 | boost::depth_first_search(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())],
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
400 | arg_pack[_root_vertex
| ~~~~~~~~~~~~~~~~~~~~~
401 | || boost::detail::get_default_starting_vertex_t<
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
402 | Graph >(g)]);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >; 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::no_property, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::odd_components_counter<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >::~IncidenceGraphConcept()'
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro 'BOOST_concept'
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:134:9: required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter<long unsigned int>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter<long unsigned int>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]'
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: required from 'void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::odd_components_counter<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
397 | boost::depth_first_search(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())],
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
400 | arg_pack[_root_vertex
| ~~~~~~~~~~~~~~~~~~~~~
401 | || boost::detail::get_default_starting_vertex_t<
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
402 | Graph >(g)]);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >; 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::no_property, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::odd_components_counter<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]'
205 | void constraints() {
| ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<boost::default_color_type>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<boost::default_color_type>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:505:5: required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:136:9: required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter<long unsigned int>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter<long unsigned int>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]'
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: required from 'void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::odd_components_counter<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
397 | boost::depth_first_search(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())],
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
400 | arg_pack[_root_vertex
| ~~~~~~~~~~~~~~~~~~~~~
401 | || boost::detail::get_default_starting_vertex_t<
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
402 | Graph >(g)]);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >; 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::no_property, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::odd_components_counter<long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]'
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function 'boost::concepts::ColorValueConcept<boost::default_color_type>::~ColorValueConcept()'
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro 'BOOST_concept'
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::odd_components_counter<long unsigned int> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::odd_components_counter<long unsigned int> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<boost::detail::odd_components_counter<long unsigned int> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:165:3: required from 'struct boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> >'
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::odd_components_counter<long unsigned int> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/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 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::odd_components_counter<long unsigned int>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >'
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >'
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
66 | BOOST_CONCEPT_USAGE(Graph)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >'
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
87 | BOOST_CONCEPT_USAGE(IncidenceGraph)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:206:7: required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]'
147 | void constraints() {
| ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:207:7: required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]'
179 | void constraints() {
| ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:208:7: required from 'void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()'
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<boost::default_color_type>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::default_color_type]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<boost::default_color_type>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::default_color_type]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:505:5: required from 'struct boost::concepts::ColorValue<boost::default_color_type>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from 'struct boost::concepts::ColorValueConcept<boost::default_color_type>'
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::ColorValue<C>::~ColorValue() [with C = boost::default_color_type]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
505 | BOOST_CONCEPT_USAGE(ColorValue)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]':
/data/gannet/ripley/R/test-dev/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::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]':
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]'
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:129:9: required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter<long unsigned int>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter<long unsigned int>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]'
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]'
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:129:9: required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter<long unsigned int>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter<long unsigned int>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]'
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]'
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:129:9: required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter<long unsigned int>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter<long unsigned int>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]'
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]'
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:129:9: required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter<long unsigned int>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter<long unsigned int>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]'
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:93:9: required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]'
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:129:9: required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter<long unsigned int>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: required from 'void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; DFSVisitor = detail::odd_components_counter<long unsigned int>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]'
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:148:7: required from 'void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()'
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:180:7: required from 'void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; Key = long unsigned int]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, long unsigned int>)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function 'boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()'
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro 'BOOST_PP_CAT_I'
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro 'BOOST_PP_CAT'
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept'
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>'
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<long unsigned int>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:68:9: required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >'
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<long unsigned int>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:69:9: required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >'
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<long unsigned int>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:70:9: required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >'
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/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::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/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 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/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 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/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 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/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 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/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 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>'
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>'
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<long unsigned int>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<long unsigned int>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<long unsigned int>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >'
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/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 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >'
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/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 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/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::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]':
/data/gannet/ripley/R/test-dev/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::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >]'
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:129:9: required from 'void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >; DFSVisitor = odd_components_counter<long unsigned int>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >'
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/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 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >'
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/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 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/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 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:514:9: required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/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::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function 'boost::SignedInteger<long int>::~SignedInteger()'
107 | template <> struct SignedInteger<long> {};
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9: required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/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::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/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::undirectedS, boost::no_property>, boost::keep_all, boost::maximum_cardinality_matching_verifier<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>, long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >::non_odd_vertex<boost::iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, int, int&> > >]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from 'typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/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 = filtered_graph<adjacency_list<vecS, vecS, undirectedS, no_property>, keep_all, maximum_cardinality_matching_verifier<adjacency_list<vecS, vecS, undirectedS, no_property>, long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int> >::non_odd_vertex<iterator_property_map<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, vec_adj_list_vertex_id_map<no_property, long unsigned int>, int, int&> > >; P = vec_adj_list_vertex_id_map<no_property, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::odd_components_counter<long unsigned int>, 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<no_property, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::odd_components_counter<long unsigned int> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]'
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]'
779 | depth_first_search(fg, visitor(occ).vertex_index_map(vm));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]'
807 | return MatchingVerifier< Graph, MateMap, VertexIndexMap >::verify_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
808 | g, mate, vm);
| ~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]'
815 | return matching< Graph, MateMap, VertexIndexMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
816 | edmonds_augmenting_path_finder, extra_greedy_matching,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
817 | maximum_cardinality_matching_verifier >(g, mate, vm);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56: required from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]'
824 | return checked_edmonds_maximum_cardinality_matching(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
825 | g, mate, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
uspr/tbr.h:2384:68: required from here
2384 | bool success = boost::checked_edmonds_maximum_cardinality_matching(G, &mate[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:21:
In constructor 'boost::bgl_named_params<T, Tag, Base>::bgl_named_params(T, const Base&) [with T = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Tag = boost::vertex_index_t; Base = boost::bgl_named_params<boost::detail::odd_components_counter<long unsigned int>, boost::graph_visitor_t, boost::no_property>]',
inlined from 'boost::bgl_named_params<PType, boost::vertex_index_t, boost::bgl_named_params<T, Tag, Base> > boost::bgl_named_params<T, Tag, Base>::vertex_index_map(const PType&) const [with PType = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; T = boost::detail::odd_components_counter<long unsigned int>; Tag = boost::graph_visitor_t; Base = boost::no_property]' at /data/gannet/ripley/R/test-dev/BH/include/boost/graph/named_function_params.hpp:217:5,
inlined from 'static bool boost::maximum_cardinality_matching_verifier<Graph, MateMap, VertexIndexMap>::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property>; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>]' at /data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:779:61,
inlined from 'bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; AugmentingPathFinder = edmonds_augmenting_path_finder; InitialMatchingFinder = extra_greedy_matching; MatchingVerifier = maximum_cardinality_matching_verifier]' at /data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:807:79,
inlined from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*; VertexIndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>]' at /data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:817:48,
inlined from 'bool boost::checked_edmonds_maximum_cardinality_matching(const Graph&, MateMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, no_property>; MateMap = long unsigned int*]' at /data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:824:56,
inlined from 'int solve_monotonic_2sat_2vars(std::vector<std::vector<int> >&, std::vector<bool>&, std::__cxx11::list<int>&)' at uspr/tbr.h:2384:68:
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/named_function_params.hpp:192:56: warning: '*(unsigned char*)((char*)&occ + offsetof(boost::detail::odd_components_counter<long unsigned int>,boost::detail::odd_components_counter<long unsigned int>::m_parity))' may be used uninitialized [-Wmaybe-uninitialized]
192 | bgl_named_params(T v, const Base& b) : m_value(v), m_base(b) {}
| ^~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp: In function 'int solve_monotonic_2sat_2vars(std::vector<std::vector<int> >&, std::vector<bool>&, std::__cxx11::list<int>&)':
/data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:778:52: note: '*(unsigned char*)((char*)&occ + offsetof(boost::detail::odd_components_counter<long unsigned int>,boost::detail::odd_components_counter<long unsigned int>::m_parity))' was declared here
778 | detail::odd_components_counter< v_size_t > occ(num_odd_components);
| ^~~
g++-14 -std=gnu++11 -shared -L/usr/local/gcc14/lib64 -L/usr/local/lib64 -o TBRDist.so RcppExports.o uspr.o
make[1]: Leaving directory '/data/gannet/ripley/R/packages/tests-devel/TBRDist/src'
make[1]: Entering directory '/data/gannet/ripley/R/packages/tests-devel/TBRDist/src'
make[1]: Leaving directory '/data/gannet/ripley/R/packages/tests-devel/TBRDist/src'
installing to /data/gannet/ripley/R/packages/tests-devel/TBRDist.Rcheck/00LOCK-TBRDist/00new/TBRDist/libs
** R
** inst
** byte-compile and prepare package for lazy loading
** help
*** installing help indices
** building package indices
** installing vignettes
** testing if installed package can be loaded from temporary location
** checking absolute paths in shared objects and dynamic libraries
** testing if installed package can be loaded from final location
** testing if installed package keeps a record of temporary installation path
* DONE (TBRDist)