* installing *source* package ‘glymotif’ ...
** this is package ‘glymotif’ version ‘1.0.0’
** package ‘glymotif’ successfully unpacked and MD5 sums checked
** using staged installation
** libs
using C++ compiler: ‘g++ (GCC) 16.2.1 20260819 (Red Hat 16.2.1-2)’
make[1]: Entering directory '/data/localhost/ripley/R/packages/tests-devel/glymotif/src'
g++ -std=gnu++20 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG  -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I/usr/local/include    -fpic  -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection   -c RcppExports.cpp -o RcppExports.o
g++ -std=gnu++20 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG  -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I/usr/local/include    -fpic  -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection   -c extract-motifs.cpp -o extract-motifs.o
g++ -std=gnu++20 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG  -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I/usr/local/include    -fpic  -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection   -c structure-matcher.cpp -o structure-matcher.o
structure-matcher.cpp:126:31: warning: trigraph ‘??-’ ignored, use ‘-trigraphs’ to enable [-Wtrigraphs]
  126 |       informative|=links[e]!="??-?";
structure-matcher.cpp:281:44: warning: trigraph ‘??-’ ignored, use ‘-trigraphs’ to enable [-Wtrigraphs]
  281 |           localized.informative|=a.token!="??-?";
structure-matcher.cpp: In constructor ‘floating::Localizations::Localizations(SEXP, const fused::Profile&, int)’:
structure-matcher.cpp:287:7: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
  287 |       for(auto& x:chosen) ++x;assignments.push_back(chosen);
      |       ^~~
structure-matcher.cpp:287:31: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
  287 |       for(auto& x:chosen) ++x;assignments.push_back(chosen);
      |                               ^~~~~~~~~~~
g++ -std=gnu++20 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG  -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I/usr/local/include    -fpic  -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection   -c vf2.cpp -o vf2.o
In file included from /data/localhost/ripley/R/test-dev/BH/include/boost/scoped_ptr.hpp:13,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:22,
                 from vf2.cpp:9:
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/scoped_ptr.hpp:63:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
   63 |     explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
      |                               ^~~~~~~~
In file included from /usr/include/c++/16/memory:80,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/unordered/detail/opt_storage.hpp:11,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/unordered/detail/archive_constructed.hpp:12,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/unordered/detail/serialize_container.hpp:14,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/unordered/detail/serialize_fca_container.hpp:12,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/unordered/unordered_set.hpp:18,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/unordered_set.hpp:17,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:20:
/usr/include/c++/16/bits/unique_ptr.h:58:28: note: declared here
   58 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/property_map/vector_property_map.hpp:14,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:598,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:27:
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  294 |     explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
      |                                 ^~~~~~~~
/usr/include/c++/16/bits/unique_ptr.h:58:28: note: declared here
   58 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  354 |     explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
      |                               ^~~~~~~~
/usr/include/c++/16/bits/unique_ptr.h:58:28: note: declared here
   58 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  365 |     shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
      |                      ^~~~~~~~
/usr/include/c++/16/bits/unique_ptr.h:58:28: note: declared here
   58 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  423 |     shared_ptr & operator=( std::auto_ptr<Y> & r )
      |                                  ^~~~~~~~
/usr/include/c++/16/bits/unique_ptr.h:58:28: note: declared here
   58 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  430 |     shared_ptr & operator=( std::auto_ptr<Y> && r )
      |                                  ^~~~~~~~
/usr/include/c++/16/bits/unique_ptr.h:58:28: note: declared here
   58 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
  432 |         this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
      |                                      ^~~~~~~~
/usr/include/c++/16/bits/unique_ptr.h:58:28: note: declared here
   58 |   template<typename> class auto_ptr;
      |                            ^~~~~~~~
In file included from /data/localhost/ripley/R/test-dev/BH/include/boost/concept/assert.hpp:35,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:19:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:127:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:31,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:20:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:106:7:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:106:7:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:138:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:154:13:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:154:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:280:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:160:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:280:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:280:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:320:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  320 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:354:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  354 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:372:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  372 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:127:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:138:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:160:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:283:9:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:283:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:320:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  320 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:354:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  354 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:372:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  372 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:286:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:320:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  320 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:354:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  354 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:372:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  372 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:183:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  183 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:193:13:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:193:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:323:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:199:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:323:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:323:9:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:354:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  354 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:372:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  372 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:199:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  199 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:183:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  183 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:199:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:324:9:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:324:9:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:354:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  354 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:372:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  372 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:199:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  199 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:220:14:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:220:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:357:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:226:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:357:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:357:9:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:372:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  372 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:226:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  226 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:226:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:358:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:358:9:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:372:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  372 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:226:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  226 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:241:14:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:241:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:375:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:247:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:375:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:375:9:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:247:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  247 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:247:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:376:9:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:376:9:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:247:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  247 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /data/localhost/ripley/R/test-dev/BH/include/boost/range/size_type.hpp:20,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/range/size.hpp:21,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/range/functions.hpp:20,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/range/iterator_range_core.hpp:41,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/range/iterator_range.hpp:13,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/range/irange.hpp:16,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/graph/detail/adjacency_list.hpp:21,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:255:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:372:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >::~RandomAccessRangeConcept()’
  372 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
In file included from /data/localhost/ripley/R/test-dev/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/mpl/int.hpp:20,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/mpl/lambda_fwd.hpp:23,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/mpl/aux_/na_spec.hpp:18,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/mpl/if.hpp:19,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_traits.hpp:17,
                 from /data/localhost/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:24:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >::~RandomAccessIteratorConcept()’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |   ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:123:5:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:15: note: in a call to non-static member function ‘boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >::~BidirectionalGraphConcept()’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1: note: in expansion of macro ‘BOOST_concept’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      | ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:932:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:932:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >::~VertexListGraphConcept()’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >::~EdgeListGraphConcept()’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::AdjacencyMatrix<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:369:5:   required from ‘struct boost::concepts::AdjacencyMatrix<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:365:1:   required from ‘struct boost::concepts::AdjacencyMatrixConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  365 | BOOST_concept(AdjacencyMatrix, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::AdjacencyMatrixConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::AdjacencyMatrixConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::AdjacencyMatrixConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::AdjacencyMatrixConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:934:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/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::AdjacencyMatrix<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::AdjacencyMatrixConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:934:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:365:15: note: in a call to non-static member function ‘boost::concepts::AdjacencyMatrixConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >::~AdjacencyMatrixConcept()’
  365 | BOOST_concept(AdjacencyMatrix, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:365:1: note: in expansion of macro ‘BOOST_concept’
  365 | BOOST_concept(AdjacencyMatrix, (G)) : Graph< G >
      | ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:952:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
   65 |     static void failed() { ((Model*)0)->constraints(); }
      |                            ~~~~~~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Key = long unsigned int]’
  147 |     void constraints() {
      |          ^~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryPredicate<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:400:5:   required from ‘struct boost::BinaryPredicate<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:398:3:   required from ‘struct boost::BinaryPredicateConcept<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >’
  398 |   BOOST_concept(BinaryPredicate,(Func)(First)(Second))
      |                 ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryPredicateConcept<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BinaryPredicateConcept<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BinaryPredicateConcept<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BinaryPredicateConcept<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:972:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryPredicate<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryPredicateConcept<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:972:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:398:17: note: in a call to non-static member function ‘boost::BinaryPredicateConcept<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >::~BinaryPredicateConcept()’
  398 |   BOOST_concept(BinaryPredicate,(Func)(First)(Second))
      |                 ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:398:3: note: in expansion of macro ‘BOOST_concept’
  398 |   BOOST_concept(BinaryPredicate,(Func)(First)(Second))
      |   ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryPredicate<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:400:5:   required from ‘struct boost::BinaryPredicate<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:398:3:   required from ‘struct boost::BinaryPredicateConcept<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int>’
  398 |   BOOST_concept(BinaryPredicate,(Func)(First)(Second))
      |                 ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryPredicateConcept<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BinaryPredicateConcept<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BinaryPredicateConcept<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BinaryPredicateConcept<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:975:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryPredicate<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryPredicateConcept<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:975:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:398:17: note: in a call to non-static member function ‘boost::BinaryPredicateConcept<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int>::~BinaryPredicateConcept()’
  398 |   BOOST_concept(BinaryPredicate,(Func)(First)(Second))
      |                 ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:398:3: note: in expansion of macro ‘BOOST_concept’
  398 |   BOOST_concept(BinaryPredicate,(Func)(First)(Second))
      |   ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:638:3:   required from ‘struct boost::Container<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  638 |   BOOST_concept(Container,(C))
      |                 ^~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:638:3:   required from ‘struct boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  638 |   BOOST_concept(Container,(C))
      |                 ^~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:980:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Container<std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:648:7:   required from ‘struct boost::Container<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:638:3:   required from ‘struct boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  638 |   BOOST_concept(Container,(C))
      |                 ^~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:980:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Container<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:980:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:638:17: note: in a call to non-static member function ‘boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >::~ContainerConcept()’
  638 |   BOOST_concept(Container,(C))
      |                 ^~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:638:3: note: in expansion of macro ‘BOOST_concept’
  638 |   BOOST_concept(Container,(C))
      |   ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:127:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:138:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:138:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  138 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:160:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5:   required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:127:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  127 |         struct IncrementableIteratorConcept : CopyConstructible<Iterator>
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  167 |     BOOST_CONCEPT_USAGE(CopyConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:138:13:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:138:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  138 |             BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  149 |         struct SinglePassIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:160:13:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  160 |             BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:286:9:   required from ‘struct boost::SinglePassRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:320:12:   required from ‘struct boost::ForwardRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  320 |     struct ForwardRangeConcept : SinglePassRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:354:12:   required from ‘struct boost::BidirectionalRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  354 |     struct BidirectionalRangeConcept : ForwardRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:372:12:   required from ‘struct boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  372 |     struct RandomAccessRangeConcept : BidirectionalRangeConcept<T>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:286:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  286 |         BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
      |         ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:183:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  183 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:199:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:199:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  199 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:183:16:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  183 |         struct ForwardIteratorConcept
      |                ^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:199:13:   required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:199:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  199 |             BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
      |             ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:226:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:226:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  226 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:226:14:   required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:226:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  226 |              BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::random_access_traversal_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:247:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:247:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  247 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:247:14:   required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessRangeConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/sort.hpp:32:5:   required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector<long unsigned int, std::allocator<long unsigned int> >; BinaryPredicate = boost::detail::vertex_in_out_degree_cmp<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:877:27:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  877 |         boost::range::sort(order, vertex_in_out_degree_cmp< Graph >(graph));
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept<Iterator>::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:247:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  247 |              BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept)
      |              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  543 |       BOOST_CONCEPT_USAGE(ForwardIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  571 |       BOOST_CONCEPT_USAGE(BidirectionalIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5:   required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  253 |     BOOST_CONCEPT_USAGE(Comparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  601 |       BOOST_CONCEPT_USAGE(RandomAccessIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   66 |     BOOST_CONCEPT_USAGE(Graph)
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   87 |     BOOST_CONCEPT_USAGE(IncidenceGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:123:5:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:123:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  123 |     BOOST_CONCEPT_USAGE(BidirectionalGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5:   required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:932:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  182 |     BOOST_CONCEPT_USAGE(VertexListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5:   required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EdgeListGraph)
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::AdjacencyMatrix<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::AdjacencyMatrix<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:369:5:   required from ‘struct boost::concepts::AdjacencyMatrix<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:365:1:   required from ‘struct boost::concepts::AdjacencyMatrixConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  365 | BOOST_concept(AdjacencyMatrix, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::AdjacencyMatrixConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::AdjacencyMatrixConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::AdjacencyMatrixConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::AdjacencyMatrixConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:934:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::AdjacencyMatrix<G>::~AdjacencyMatrix() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:369:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  369 |     BOOST_CONCEPT_USAGE(AdjacencyMatrix)
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:952:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:148:7:   required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Key = long unsigned int]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:952:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
   29 | #    define BOOST_PP_CAT_I(a, b) a ## b
      |                                  ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
   23 |     struct BOOST_PP_CAT(name,Concept)                                           \
      |            ^~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |   ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryPredicate<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryPredicate<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:400:5:   required from ‘struct boost::BinaryPredicate<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:398:3:   required from ‘struct boost::BinaryPredicateConcept<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >’
  398 |   BOOST_concept(BinaryPredicate,(Func)(First)(Second))
      |                 ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryPredicateConcept<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BinaryPredicateConcept<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BinaryPredicateConcept<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BinaryPredicateConcept<{anonymous}::EdgeCompatibility, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:972:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BinaryPredicate<Func, First, Second>::~BinaryPredicate() [with Func = {anonymous}::EdgeCompatibility; First = boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>; Second = boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:400:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  400 |     BOOST_CONCEPT_USAGE(BinaryPredicate) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryPredicate<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BinaryPredicate<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:400:5:   required from ‘struct boost::BinaryPredicate<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:398:3:   required from ‘struct boost::BinaryPredicateConcept<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int>’
  398 |   BOOST_concept(BinaryPredicate,(Func)(First)(Second))
      |                 ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BinaryPredicateConcept<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::BinaryPredicateConcept<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::BinaryPredicateConcept<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::BinaryPredicateConcept<{anonymous}::VertexCompatibility, long unsigned int, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:975:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BinaryPredicate<Func, First, Second>::~BinaryPredicate() [with Func = {anonymous}::VertexCompatibility; First = long unsigned int; Second = long unsigned int]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:400:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  400 |     BOOST_CONCEPT_USAGE(BinaryPredicate) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:638:3:   required from ‘struct boost::Container<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  638 |   BOOST_concept(Container,(C))
      |                 ^~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:638:3:   required from ‘struct boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  638 |   BOOST_concept(Container,(C))
      |                 ^~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:980:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Container<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Container<std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:648:7:   required from ‘struct boost::Container<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:638:3:   required from ‘struct boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >’
  638 |   BOOST_concept(Container,(C))
      |                 ^~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:980:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Container<C>::~Container() [with C = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:648:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  648 |       BOOST_CONCEPT_USAGE(Container)
      |       ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:126:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-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::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:126:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::bidirectional_graph_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:932:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:932:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::vertex_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::vertex_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:932:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:932:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::edge_list_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::edge_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::edge_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::edge_list_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::edge_list_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::readable_property_map_tag, boost::readable_property_map_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3:   required from ‘struct boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>’
  206 |   BOOST_concept(Convertible,(X)(Y))
      |                 ^~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::readable_property_map_tag, boost::readable_property_map_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int> >’
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:952:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:650:11:   required from ‘boost::Container<C>::~Container() [with C = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:638:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
  638 |   BOOST_concept(Container,(C))
      |                 ^~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:980:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:650:11:   required from ‘boost::Container<C>::~Container() [with C = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:638:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
  638 |   BOOST_concept(Container,(C))
      |                 ^~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:980:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:650:11:   required from ‘boost::Container<C>::~Container() [with C = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:638:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
  638 |   BOOST_concept(Container,(C))
      |                 ^~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:980:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::LessThanComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:243:5:   required from ‘struct boost::LessThanComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::LessThanComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::LessThanComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::LessThanComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:517:50:   required from ‘bool boost::detail::state<Graph1, Graph2, IndexMap1, IndexMap2, EdgeEquivalencePredicate, VertexEquivalencePredicate, SubGraphIsoMapCallback, problem_selection>::feasible(const vertex1_type&, const vertex2_type&) [with Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap1 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMap2 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector; boost::detail::problem_selector problem_selection = boost::detail::subgraph_mono; vertex1_type = long unsigned int; vertex2_type = long unsigned int]’
  517 |                 equivalent_edge_exists< Graph2 > edge2_exists;
      |                                                  ^~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:800:31:   required from ‘bool boost::detail::match(const Graph1&, const Graph2&, SubGraphIsoMapCallback, const VertexOrder1&, state<Graph1, Graph2, IndexMap1, IndexMap2, EdgeEquivalencePredicate, VertexEquivalencePredicate, SubGraphIsoMapCallback, problem_selection>&) [with Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap1 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMap2 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder1 = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector; problem_selector problem_selection = boost::detail::subgraph_mono]’
  800 |                 if (s.feasible(*graph1_verts_iter, *graph2_verts_iter))
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1009:29:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1009 |         return detail::match(
      |                ~~~~~~~~~~~~~^
 1010 |             graph_small, graph_large, user_callback, vertex_order_small, s);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::LessThanComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::LessThanComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:321:9:   required from ‘struct boost::detail::equivalent_edge_exists<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >, void>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:517:50:   required from ‘bool boost::detail::state<Graph1, Graph2, IndexMap1, IndexMap2, EdgeEquivalencePredicate, VertexEquivalencePredicate, SubGraphIsoMapCallback, problem_selection>::feasible(const vertex1_type&, const vertex2_type&) [with Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap1 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMap2 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector; boost::detail::problem_selector problem_selection = boost::detail::subgraph_mono; vertex1_type = long unsigned int; vertex2_type = long unsigned int]’
  517 |                 equivalent_edge_exists< Graph2 > edge2_exists;
      |                                                  ^~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:800:31:   required from ‘bool boost::detail::match(const Graph1&, const Graph2&, SubGraphIsoMapCallback, const VertexOrder1&, state<Graph1, Graph2, IndexMap1, IndexMap2, EdgeEquivalencePredicate, VertexEquivalencePredicate, SubGraphIsoMapCallback, problem_selection>&) [with Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap1 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMap2 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder1 = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector; problem_selector problem_selection = boost::detail::subgraph_mono]’
  800 |                 if (s.feasible(*graph1_verts_iter, *graph2_verts_iter))
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1009:29:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1009 |         return detail::match(
      |                ~~~~~~~~~~~~~^
 1010 |             graph_small, graph_large, user_callback, vertex_order_small, s);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::LessThanComparable<TT>::~LessThanComparable() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:243:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  243 |     BOOST_CONCEPT_USAGE(LessThanComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:514:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘constexpr boost::SignedInteger<long int>::~SignedInteger()’
  107 |   template <> struct SignedInteger<long> {};
      |                      ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  540 |   BOOST_concept(ForwardIterator,(TT))
      |                 ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:545:11:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:545:11:   required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7:   required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  568 |   BOOST_concept(BidirectionalIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:573:11:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:573:11:   required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7:   required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:603:11:   required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
  597 |   BOOST_concept(RandomAccessIterator,(TT))
      |                 ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:68:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:68:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:69:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:69:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:70:9:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:70:9:   required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5:   required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:89:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:93:9:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-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::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:93:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:87:5:   required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:126:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::bidirectional_graph_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:932:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::vertex_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:932:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::edge_list_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::edge_list_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::edge_list_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:650:11:   required from ‘boost::Container<C>::~Container() [with C = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:638:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
  638 |   BOOST_concept(Container,(C))
      |                 ^~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:980:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<__gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:650:11:   required from ‘boost::Container<C>::~Container() [with C = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:638:3:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ContainerConcept<std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
  638 |   BOOST_concept(Container,(C))
      |                 ^~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:980:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<const long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::LessThanComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::LessThanComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:243:5:   required from ‘struct boost::LessThanComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::LessThanComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::LessThanComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::LessThanComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:517:50:   required from ‘bool boost::detail::state<Graph1, Graph2, IndexMap1, IndexMap2, EdgeEquivalencePredicate, VertexEquivalencePredicate, SubGraphIsoMapCallback, problem_selection>::feasible(const vertex1_type&, const vertex2_type&) [with Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap1 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMap2 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector; boost::detail::problem_selector problem_selection = boost::detail::subgraph_mono; vertex1_type = long unsigned int; vertex2_type = long unsigned int]’
  517 |                 equivalent_edge_exists< Graph2 > edge2_exists;
      |                                                  ^~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:800:31:   required from ‘bool boost::detail::match(const Graph1&, const Graph2&, SubGraphIsoMapCallback, const VertexOrder1&, state<Graph1, Graph2, IndexMap1, IndexMap2, EdgeEquivalencePredicate, VertexEquivalencePredicate, SubGraphIsoMapCallback, problem_selection>&) [with Graph1 = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; Graph2 = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap1 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMap2 = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder1 = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector; problem_selector problem_selection = boost::detail::subgraph_mono]’
  800 |                 if (s.feasible(*graph1_verts_iter, *graph2_verts_iter))
      |                     ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1009:29:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1009 |         return detail::match(
      |                ~~~~~~~~~~~~~^
 1010 |             graph_small, graph_large, user_callback, vertex_order_small, s);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::LessThanComparable<TT>::~LessThanComparable() [with TT = boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:243:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  243 |     BOOST_CONCEPT_USAGE(LessThanComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5:   required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:886:41:   required from ‘void boost::detail::sort_vertices(const Graph&, IndexMap, VertexOrder&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrder = std::vector<long unsigned int, std::allocator<long unsigned int> >]’
  886 |             = make_iterator_property_map(freq_vec.begin(), index_map);
      |               ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1026:26:   required from ‘std::vector<typename boost::graph_traits<G>::vertex_descriptor> boost::vertex_order_by_mult(const Graph&) [with Graph = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
 1026 |     detail::sort_vertices(graph, get(vertex_index, graph), vertex_order);
      |     ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:197:32:   required from here
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5:   required from ‘struct boost::DefaultConstructible<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  137 |     BOOST_CONCEPT_USAGE(DefaultConstructible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<long unsigned int>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50:   required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
   52 |     BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
      |                                                  ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:932:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:932:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:932:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-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::range_detail::integer_iterator<long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:932:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35:   [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:89:9:   required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:87:5:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:932:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:932:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9:   required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:932:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5:   required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  145 |     BOOST_CONCEPT_USAGE(Assignable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5:   required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
  502 |   BOOST_concept(InputIterator,(TT))
      |                 ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  233 |     BOOST_CONCEPT_USAGE(EqualityComparable) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7:   required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > > >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  512 |       BOOST_CONCEPT_USAGE(InputIterator)
      |       ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |     ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::property<boost::edge_index_t, int> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>)>’
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9:   [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/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/localhost/ripley/R/test-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/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9:   required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35:   required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int>]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_index_t, int> > >, boost::detail::edge_desc_impl<boost::bidirectional_tag, long unsigned int>, long int> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:125:9:   required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:118:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
      |               ^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:931:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’
   50 |     static void failed() { ((Model*)0)->~Model(); }
      |                            ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5:   required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62:   required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
   32 |   inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
      |                                                              ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5:   required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
   44 |       , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
      |                       ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51:   required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
   45 |     typedef boost::integral_constant<bool, value> type;
      |                                                   ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8:   [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
   72 | struct requirement_<void(*)(Model)>
      |        ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9:   required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> > >]’
  226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
      |               ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:933:9:   required from ‘bool boost::detail::vf2_subgraph_morphism(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with problem_selector problem_selection = boost::detail::subgraph_mono; GraphSmall = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; GraphLarge = boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_index_t, int> >; IndexMapSmall = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; IndexMapLarge = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
   92 |     &::boost::concepts::requirement_<ModelFnPtr>::failed>    \
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1043:66:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, IndexMapSmall, IndexMapLarge, const VertexOrderSmall&, EdgeEquivalencePredicate, VertexEquivalencePredicate) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; IndexMapSmall = vec_adj_list_vertex_id_map<no_property, long unsigned int>; IndexMapLarge = vec_adj_list_vertex_id_map<no_property, long unsigned int>; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; EdgeEquivalencePredicate = {anonymous}::EdgeCompatibility; VertexEquivalencePredicate = {anonymous}::VertexCompatibility; SubGraphIsoMapCallback = {anonymous}::MappingCollector]’
 1043 |     return detail::vf2_subgraph_morphism< detail::subgraph_mono >(graph_small,
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
 1044 |         graph_large, user_callback, index_map_small, index_map_large,
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1045 |         vertex_order_small, edge_comp, vertex_comp);
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~               
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/vf2_sub_graph_iso.hpp:1069:29:   required from ‘bool boost::vf2_subgraph_mono(const GraphSmall&, const GraphLarge&, SubGraphIsoMapCallback, const VertexOrderSmall&, const bgl_named_params<Param, Tag, Rest>&) [with GraphSmall = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; GraphLarge = adjacency_list<vecS, vecS, bidirectionalS, no_property, property<edge_index_t, int> >; VertexOrderSmall = std::vector<long unsigned int, std::allocator<long unsigned int> >; SubGraphIsoMapCallback = {anonymous}::MappingCollector; Param = {anonymous}::VertexCompatibility; Tag = vertices_equivalent_t; Rest = bgl_named_params<{anonymous}::EdgeCompatibility, edges_equivalent_t, no_property>]’
 1069 |     return vf2_subgraph_mono(graph_small, graph_large, user_callback,
      |            ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1070 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1071 |             get_param(params, vertex_index1), graph_small, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1072 |         choose_const_pmap(
      |         ~~~~~~~~~~~~~~~~~~   
 1073 |             get_param(params, vertex_index2), graph_large, vertex_index),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1074 |         vertex_order_small,
      |         ~~~~~~~~~~~~~~~~~~~  
 1075 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1076 |             get_param(params, edges_equivalent_t()), always_equivalent()),
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 1077 |         choose_param(
      |         ~~~~~~~~~~~~~        
 1078 |             get_param(params, vertices_equivalent_t()), always_equivalent()));
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vf2.cpp:193:27:   required from here
  193 |   boost::vf2_subgraph_mono(
      |   ~~~~~~~~~~~~~~~~~~~~~~~~^
  194 |     motif,
      |     ~~~~~~                 
  195 |     glycan,
      |     ~~~~~~~                
  196 |     callback,
      |     ~~~~~~~~~              
  197 |     boost::vertex_order_by_mult(motif),
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  198 |     boost::edges_equivalent(edge_predicate)
      |     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  199 |       .vertices_equivalent(vertex_predicate)
      |       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200 |   );
      |   ~                        
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
   20 |     ~usage_requirements() { ((Model*)0)->~Model(); }
      |                             ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
   37 |       ~model()
      |       ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
  208 |     BOOST_CONCEPT_USAGE(Convertible) {
      |     ^~~~~~~~~~~~~~~~~~~
g++ -std=gnu++20 -shared -L/usr/local/lib64 -o glymotif.so RcppExports.o extract-motifs.o structure-matcher.o vf2.o
make[1]: Leaving directory '/data/localhost/ripley/R/packages/tests-devel/glymotif/src'
make[1]: Entering directory '/data/localhost/ripley/R/packages/tests-devel/glymotif/src'
make[1]: Leaving directory '/data/localhost/ripley/R/packages/tests-devel/glymotif/src'
installing to /data/localhost/ripley/R/packages/tests-devel/glymotif.Rcheck/00LOCK-glymotif/00new/glymotif/libs
** R
** inst
** byte-compile and prepare package for lazy loading
** help
*** installing help indices
*** copying figures
** building package indices
** installing vignettes
** testing if installed package can be loaded from temporary location
** checking absolute paths in shared objects and dynamic libraries
** testing if installed package can be loaded from final location
** testing if installed package keeps a record of temporary installation path
* DONE (glymotif)