* installing *source* package ‘TDA’ ...
** this is package ‘TDA’ version ‘1.9.1’
** package ‘TDA’ successfully unpacked and MD5 sums checked
** using staged installation
** libs
using C++ compiler: ‘g++-14 (GCC) 14.2.0’
using C++17
make[1]: Entering directory '/data/gannet/ripley/R/packages/tests-devel/TDA/src'
g++-14 -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I. -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DBOOST_DISABLE_THREADS -DCGAL_EIGEN3_ENABLED -DCGAL_HEADER_ONLY -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -DR_NO_REMAP -c RcppExports.cpp -o RcppExports.o
g++-14 -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I. -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DBOOST_DISABLE_THREADS -DCGAL_EIGEN3_ENABLED -DCGAL_HEADER_ONLY -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -DR_NO_REMAP -c diag.cpp -o diag.o
In file included from ./CGAL/license/Triangulation.h:17,
from ./CGAL/Delaunay_triangulation.h:15,
from ./gudhi/Alpha_complex.h:26,
from ./tdautils/gudhiUtils.h:13,
from diag.cpp:19:
./CGAL/config.h:124:9: warning: "BOOST_PARAMETER_MAX_ARITY" redefined
124 | #define BOOST_PARAMETER_MAX_ARITY 12
| ^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/parameter/aux_/is_tagged_argument.hpp:17,
from /data/gannet/ripley/R/test-dev/BH/include/boost/parameter/is_argument_pack.hpp:9,
from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/named_function_params.hpp:20,
from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:21,
from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/max_cardinality_matching.hpp:21,
from ./topology/persistence-diagram.hpp:144,
from ./topology/persistence-diagram.h:176,
from ./tdautils/ripsL2.h:9,
from diag.cpp:9:
/data/gannet/ripley/R/test-dev/BH/include/boost/parameter/config.hpp:61:9: note: this is the location of the previous definition
61 | #define BOOST_PARAMETER_MAX_ARITY BOOST_MPL_LIMIT_VECTOR_SIZE
| ^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/cstdfloat.hpp:27,
from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/float128_functions.hpp:15,
from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/fpclassify.hpp:13,
from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/default_ops.hpp:15,
from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/detail/generic_interconvert.hpp:12,
from /data/gannet/ripley/R/test-dev/BH/include/boost/multiprecision/number.hpp:12,
from ./CGAL/boost_mp.h:31,
from ./CGAL/internal/Exact_type_selector.h:27,
from ./CGAL/Epeck_d.h:22,
from ./gudhi/Alpha_complex.h:28:
/data/gannet/ripley/R/test-dev/BH/include/boost/math/cstdfloat/cstdfloat_cmath.hpp:714:16: warning: non-standard suffix on floating constant [-Wpedantic]
714 | else if (x == BOOST_FLOAT128_C(0.0))
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/math/cstdfloat/cstdfloat_cmath.hpp:717:16: warning: non-standard suffix on floating constant [-Wpedantic]
717 | if (::BOOST_CSTDFLOAT_FLOAT128_FABS(x) < BOOST_CSTDFLOAT_FLOAT128_MIN)
| ^~
In file included from ./phat/representations/bit_tree_pivot_column.h:22,
from ./phat/boundary_matrix.h:22,
from ./phat/compute_persistence_pairs.h:22,
from ./tdautils/phatUtils.h:5,
from diag.cpp:25:
./phat/representations/abstract_pivot_column.h:66: warning: ignoring '#pragma omp parallel' [-Wunknown-pragmas]
66 | #pragma omp parallel for
./phat/representations/abstract_pivot_column.h:81: warning: ignoring '#pragma omp parallel' [-Wunknown-pragmas]
81 | #pragma omp parallel for
./phat/boundary_matrix.h:182: warning: ignoring '#pragma omp parallel' [-Wunknown-pragmas]
182 | #pragma omp parallel for private( temp_col )
In file included from ./phat/compute_persistence_pairs.h:23:
./phat/helpers/dualize.h:46: warning: ignoring '#pragma omp parallel' [-Wunknown-pragmas]
46 | #pragma omp parallel for
./phat/helpers/dualize.h:57: warning: ignoring '#pragma omp parallel' [-Wunknown-pragmas]
57 | #pragma omp parallel for
./phat/helpers/dualize.h:61: warning: ignoring '#pragma omp parallel' [-Wunknown-pragmas]
61 | #pragma omp parallel for
In file included from ./tdautils/phatUtils.h:12:
./phat/algorithms/chunk_reduction.h:55: warning: ignoring '#pragma omp parallel' [-Wunknown-pragmas]
55 | #pragma omp parallel for schedule( guided, 1 )
./phat/algorithms/chunk_reduction.h:62: warning: ignoring '#pragma omp parallel' [-Wunknown-pragmas]
62 | #pragma omp parallel for schedule( guided, 1 )
./phat/algorithms/chunk_reduction.h:76: warning: ignoring '#pragma omp parallel' [-Wunknown-pragmas]
76 | #pragma omp parallel for
./phat/algorithms/chunk_reduction.h:85: warning: ignoring '#pragma omp parallel' [-Wunknown-pragmas]
85 | #pragma omp parallel for schedule( guided, 1 ), private( temp_col )
./phat/algorithms/chunk_reduction.h:152: warning: ignoring '#pragma omp parallel' [-Wunknown-pragmas]
152 | #pragma omp parallel for schedule( guided, 1 ), private( stack, cur_col_values )
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
from /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/vector_property_map.hpp:14,
from /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:598,
from ./utilities/property-maps.h:6,
from ./topology/complex-traits.h:6,
from ./topology/filtration.h:7,
from ./tdautils/ripsL2.h:6:
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
326 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
| ^~~~~~~~
In file included from /usr/local/gcc14/include/c++/14.2.0/memory:78,
from /data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
from /data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/usr/local/gcc14/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp: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/local/gcc14/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp: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/local/gcc14/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp: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/local/gcc14/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp: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/local/gcc14/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function 'boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)':
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp: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/local/gcc14/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/bind/mem_fn.hpp:23,
from /data/gannet/ripley/R/test-dev/BH/include/boost/bind/bind.hpp:23,
from /data/gannet/ripley/R/test-dev/BH/include/boost/multi_index/detail/ord_index_impl.hpp:82,
from /data/gannet/ripley/R/test-dev/BH/include/boost/multi_index/ordered_index.hpp:17,
from ./topology/filtration.h:14:
/data/gannet/ripley/R/test-dev/BH/include/boost/get_pointer.hpp: At global scope:
/data/gannet/ripley/R/test-dev/BH/include/boost/get_pointer.hpp:48:40: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
| ^~~~~~~~
/usr/local/gcc14/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/detail/deprecated_macros.hpp:8,
from /data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/detail/sp_counted_base.hpp:22,
from /data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/detail/shared_count.hpp:22:
/data/gannet/ripley/R/test-dev/BH/include/boost/config/pragma_message.hpp:24:34: note: '#pragma message: The practice of declaring the Bind placeholders (_1, _2, ...) in the global namespace is deprecated. Please use <boost/bind/bind.hpp> + using namespace boost::placeholders, or define BOOST_BIND_GLOBAL_PLACEHOLDERS to retain the current behavior.'
24 | # define BOOST_PRAGMA_MESSAGE(x) _Pragma(BOOST_STRINGIZE(message(x)))
| ^~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/bind.hpp:36:1: note: in expansion of macro 'BOOST_PRAGMA_MESSAGE'
36 | BOOST_PRAGMA_MESSAGE(
| ^~~~~~~~~~~~~~~~~~~~
In file included from ./topology/dynamic-persistence.h:332,
from ./tdautils/ripsL2.h:8:
./topology/dynamic-persistence.hpp: In member function 'bool DynamicPersistenceTrails<Data_, ChainTraits_, ContainerTraits_, Element_, Comparison_, ConsistencyComparison_>::transpose(iterator, const DimensionFunctor&, Visitor)':
./topology/dynamic-persistence.hpp:60:73: warning: typedef 'TrailIterator' locally defined but not used [-Wunused-local-typedefs]
60 | typedef typename Element::Trail::iterator TrailIterator;
| ^~~~~~~~~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/scoped_ptr.hpp:13,
from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:22,
from ./topology/persistence-diagram.hpp:143:
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/data/gannet/ripley/R/test-dev/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: 'template<class> class std::auto_ptr' is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
75 | explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
| ^~~~~~~~
/usr/local/gcc14/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from ./boost/container/detail/flat_tree.hpp:30,
from ./boost/container/flat_map.hpp:29,
from ./gudhi/Simplex_tree/Simplex_tree_siblings.h:16,
from ./gudhi/Simplex_tree.h:15,
from ./tdautils/gudhiUtils.h:10:
./boost/container/vector.hpp:3173:1: error: 'BOOST_MOVE_STD_NS_BEG' does not name a type; did you mean 'BOOST_MATH_STD_USING'?
3173 | BOOST_MOVE_STD_NS_BEG
| ^~~~~~~~~~~~~~~~~~~~~
| BOOST_MATH_STD_USING
./boost/container/vector.hpp:3180:1: error: 'BOOST_MOVE_STD_NS_END' does not name a type; did you mean 'BOOST_MOVE_CATCH_END'?
3180 | BOOST_MOVE_STD_NS_END
| ^~~~~~~~~~~~~~~~~~~~~
| BOOST_MOVE_CATCH_END
./boost/container/detail/flat_tree.hpp: In function 'void boost::container::dtl::flat_tree_container_inplace_merge(SequenceContainer&, typename SequenceContainer::iterator, Compare, boost::move_detail::true_)':
./boost/container/detail/flat_tree.hpp:148:38: error: 'back_free_capacity' was not declared in this scope
148 | (braw, iraw, eraw, comp, eraw, back_free_capacity<SequenceContainer>::get(dest));
| ^~~~~~~~~~~~~~~~~~
./boost/container/detail/flat_tree.hpp:148:74: error: expected primary-expression before '>' token
148 | (braw, iraw, eraw, comp, eraw, back_free_capacity<SequenceContainer>::get(dest));
| ^
./boost/container/detail/flat_tree.hpp: In function 'void boost::container::dtl::flat_tree_container_inplace_sort_ending(SequenceContainer&, typename SequenceContainer::iterator, Compare, boost::move_detail::true_)':
./boost/container/detail/flat_tree.hpp:175:32: error: 'back_free_capacity' was not declared in this scope
175 | (iraw, eraw, comp, eraw, back_free_capacity<SequenceContainer>::get(dest));
| ^~~~~~~~~~~~~~~~~~
./boost/container/detail/flat_tree.hpp:175:68: error: expected primary-expression before '>' token
175 | (iraw, eraw, comp, eraw, back_free_capacity<SequenceContainer>::get(dest));
| ^
In file included from diag.cpp:34:
./kde.h: In instantiation of 'RealVector kde(const RealMatrix&, const RealMatrix&, unsigned int, unsigned int, unsigned int, double, const std::string&, const RealVector&, bool, const Print&) [with RealVector = Rcpp::Vector<14, Rcpp::PreserveStorage>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...); std::string = std::__cxx11::basic_string<char>]':
diag.cpp:174:13: required from here
174 | return kde(
| ~~~^
175 | X, Grid, X.nrow(), Grid.ncol(), Grid.nrow(), h, kertype, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
176 | printProgress, Rprintf);
| ~~~~~~~~~~~~~~~~~~~~~~~
./kde.h:21:16: warning: unused variable 'pi' [-Wunused-variable]
21 | const double pi = 3.141592653589793;
| ^~
In file included from diag.cpp:16:
./tdautils/typecastUtils.h: In instantiation of 'RcppList filtrationGudhiToRcpp(const SimplexTree&) [with RcppList = Rcpp::Vector<19>; RcppVector = Rcpp::Vector<14, Rcpp::PreserveStorage>; SimplexTree = Gudhi::Simplex_tree<>]':
diag.cpp:416:63: required from here
416 | filtrationGudhiToRcpp< Rcpp::List, Rcpp::NumericVector >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
417 | AlphaShapeFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
418 | X, printProgress, Rprintf, coordinates));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./tdautils/typecastUtils.h:394:12: warning: unused variable 'iFill' [-Wunused-variable]
394 | unsigned iFill = 0;
| ^~~~~
./tdautils/typecastUtils.h: In instantiation of 'void filtrationGudhiToTda(const SimplexTree&, VectorList&, RealVector&, VectorList&) [with IntegerVector = Rcpp::Vector<13>; SimplexTree = Gudhi::Simplex_tree<>; VectorList = Rcpp::Vector<19>; RealVector = Rcpp::Vector<14, Rcpp::PreserveStorage>]':
./rips.h:63:38: required from 'void ripsFiltration(const RealMatrix&, unsigned int, unsigned int, int, double, const std::string&, const std::string&, bool, const Print&, VectorList&, RealVector&, VectorList&) [with IntVector = Rcpp::Vector<13>; RealMatrix = Rcpp::Matrix<14>; VectorList = Rcpp::Vector<19>; RealVector = Rcpp::Vector<14, Rcpp::PreserveStorage>; Print = void(const char*, ...); std::string = std::__cxx11::basic_string<char>]'
63 | filtrationGudhiToTda< IntVector >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
64 | RipsFiltrationGudhi< Gudhi::Simplex_tree<> >(X, nSample, nDim,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
65 | maxdimension, maxscale, printProgress, print),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
66 | cmplx, values, boundary);
| ~~~~~~~~~~~~~~~~~~~~~~~~
diag.cpp:329:40: required from here
329 | ripsFiltration< Rcpp::IntegerVector >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
330 | X, X.nrow(), X.ncol(), maxdimension, maxscale, dist, library,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
331 | printProgress, Rprintf, cmplx, values, boundary);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./tdautils/typecastUtils.h:350:12: warning: unused variable 'iFill' [-Wunused-variable]
350 | unsigned iFill = 0;
| ^~~~~
In file included from diag.cpp:13:
./tdautils/gridUtils.h: In instantiation of 'void addOddTets(int, int, int, int, int, VectorList&) [with VectorList = std::vector<std::vector<unsigned int> >]':
./tdautils/gridUtils.h:315:14: required from 'void addAllTetrahedra(int, int, int, int, int, VectorList&) [with VectorList = std::vector<std::vector<unsigned int> >]'
315 | addOddTets(ncols, nrows, i, j, k, cmplx);
| ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./tdautils/gridUtils.h:363:20: required from 'void simplicesFromGrid(const DimensionVector&, int, VectorList&) [with DimensionVector = Rcpp::Vector<13>; VectorList = std::vector<std::vector<unsigned int> >]'
363 | addAllTetrahedra(ncols, nrows, i, j, k, cmplx);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./grid.h:90:22: required from 'void gridFiltration(const RealVector&, const DimensionVector&, int, const std::string&, bool, const Print&, std::vector<ValueT>&, std::vector<double>&) [with RealVector = Rcpp::Vector<14, Rcpp::PreserveStorage>; DimensionVector = Rcpp::Vector<13>; Print = void(const char*, ...); VertexVector = std::vector<unsigned int>; std::string = std::__cxx11::basic_string<char>]'
90 | simplicesFromGrid(gridDim, maxdimension + 1, cmplx);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diag.cpp:76:17: required from here
76 | gridFiltration(
| ~~~~~~~~~~~~~~^
77 | FUNvalues, gridDim, maxdimension, decomposition, printProgress, Rprintf,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
78 | cmplx, values);
| ~~~~~~~~~~~~~~
./tdautils/gridUtils.h:183:13: warning: unused variable 'value' [-Wunused-variable]
183 | double value, value2; // max of value and value 2 is the fcn value.
| ^~~~~
./tdautils/gridUtils.h:183:20: warning: unused variable 'value2' [-Wunused-variable]
183 | double value, value2; // max of value and value 2 is the fcn value.
| ^~~~~~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/concept/assert.hpp:35,
from /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:19:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:125:16: required from 'struct boost::range_detail::IncrementableIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
125 | struct IncrementableIteratorConcept : CopyConstructible<Iterator>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
147 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:31,
from /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:20:
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >]':
/data/gannet/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/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from 'struct boost::range_detail::IncrementableIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
147 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13: required from 'struct boost::range_detail::IncrementableIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
147 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
147 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >]':
/data/gannet/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/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:152:13: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:152:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:278:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:278:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:278:9: required from 'struct boost::SinglePassRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
318 | struct ForwardRangeConcept : SinglePassRangeConcept<T>
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
352 | struct BidirectionalRangeConcept : ForwardRangeConcept<T>
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:125:16: required from 'struct boost::range_detail::IncrementableIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
125 | struct IncrementableIteratorConcept : CopyConstructible<Iterator>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
147 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13: required from 'struct boost::range_detail::IncrementableIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
147 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
147 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:281:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:281:9: required from 'struct boost::SinglePassRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
318 | struct ForwardRangeConcept : SinglePassRangeConcept<T>
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
352 | struct BidirectionalRangeConcept : ForwardRangeConcept<T>
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
318 | struct ForwardRangeConcept : SinglePassRangeConcept<T>
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
352 | struct BidirectionalRangeConcept : ForwardRangeConcept<T>
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:181:16: required from 'struct boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
181 | struct ForwardIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >]':
/data/gannet/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/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:191:13: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:191:13: required from 'struct boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:321:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: required from 'struct boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:321:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:321:9: required from 'struct boost::ForwardRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
352 | struct BidirectionalRangeConcept : ForwardRangeConcept<T>
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:181:16: required from 'struct boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
181 | struct ForwardIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: required from 'struct boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:322:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:322:9: required from 'struct boost::ForwardRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
352 | struct BidirectionalRangeConcept : ForwardRangeConcept<T>
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >]':
/data/gannet/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/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:218:14: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:218:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:355:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:355:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:355:9: required from 'struct boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:356:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:356:9: required from 'struct boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/range/size_type.hpp:20,
from /data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:21,
from /data/gannet/ripley/R/test-dev/BH/include/boost/range/functions.hpp:20,
from /data/gannet/ripley/R/test-dev/BH/include/boost/range/iterator_range_core.hpp:38,
from /data/gannet/ripley/R/test-dev/BH/include/boost/range/iterator_range.hpp:13,
from /data/gannet/ripley/R/test-dev/BH/include/boost/range/irange.hpp:16,
from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/detail/adjacency_list.hpp:21,
from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:255:
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12: note: in a call to non-static member function 'boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >::~BidirectionalRangeConcept()'
352 | struct BidirectionalRangeConcept : ForwardRangeConcept<T>
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:125:16: required from 'struct boost::range_detail::IncrementableIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
125 | struct IncrementableIteratorConcept : CopyConstructible<Iterator>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
147 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13: required from 'struct boost::range_detail::IncrementableIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
147 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
147 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:125:16: required from 'struct boost::range_detail::IncrementableIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
125 | struct IncrementableIteratorConcept : CopyConstructible<Iterator>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
147 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::IncrementableIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13: required from 'struct boost::range_detail::IncrementableIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
147 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:147:16: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
147 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: required from 'struct boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::SinglePassRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9: required from 'struct boost::SinglePassRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:318:12: required from 'struct boost::ForwardRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
318 | struct ForwardRangeConcept : SinglePassRangeConcept<T>
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:352:12: required from 'struct boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >'
352 | struct BidirectionalRangeConcept : ForwardRangeConcept<T>
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:181:16: required from 'struct boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
181 | struct ForwardIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: required from 'struct boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:181:16: required from 'struct boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
181 | struct ForwardIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: required from 'struct boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::ForwardIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::ForwardIteratorConcept<Iterator>::~ForwardIteratorConcept() [with Iterator = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]':
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >]'
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: required from 'struct boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> >]'
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >::value'
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::range_detail::BidirectionalIteratorConcept<boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true> > >'
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BidirectionalRangeConcept<boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void> >)>'
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/range/adaptor/reversed.hpp:52:13: required from 'boost::range_detail::reversed_range<BidirectionalRange> boost::adaptors::reverse(BidirectionalRange&) [with BidirectionalRange = boost::container::flat_map<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> >, std::less<int>, void>]'
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./gudhi/Simplex_tree.h:1400:50: required from 'bool Gudhi::Simplex_tree<SimplexTreeOptions>::make_filtration_non_decreasing() [with SimplexTreeOptions = Gudhi::Simplex_tree_options_full_featured]'
1400 | for (auto& simplex : boost::adaptors::reverse(root_.members())) {
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:463:47: required from 'bool Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::create_complex(SimplicialComplexForAlpha&, Filtration_value, bool, bool) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Filtration_value = double; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false]'
463 | complex.make_filtration_non_decreasing();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
./tdautils/gudhiUtils.h:390:45: required from 'SimplexTree AlphaComplexFiltrationGudhi(const RealMatrix&, bool, Print&) [with SimplexTree = Gudhi::Simplex_tree<>; RealMatrix = Rcpp::Matrix<14>; Print = void(const char*, ...)]'
390 | alpha_complex_from_points.create_complex(simplex);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
diag.cpp:492:59: required from here
492 | AlphaComplexFiltrationGudhi< Gudhi::Simplex_tree<> >(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
493 | X, printProgress, Rprintf));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::range_detail::BidirectionalIteratorConcept<Iterator>::~BidirectionalIteratorConcept() [with Iterator = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, true>]'
37 | ~model()
| ^
/data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro 'BOOST_CONCEPT_USAGE'
224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
make[1]: *** [/data/gannet/ripley/R/R-devel/etc/Makeconf:208: diag.o] Error 1
make[1]: Target 'all' not remade because of errors.
make[1]: Leaving directory '/data/gannet/ripley/R/packages/tests-devel/TDA/src'
ERROR: compilation failed for package ‘TDA’
* removing ‘/data/gannet/ripley/R/packages/tests-devel/TDA.Rcheck/TDA’