* installing to library ‘/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages’
* installing *source* package ‘TDA’ ...
** package ‘TDA’ successfully unpacked and MD5 sums checked
** using staged installation
** libs
/bin/sh: 1: clang++: not found
expr: syntax error: unexpected argument ‘50000’
using C++ compiler: ‘g++-14 (Debian 14.2.0-8) 14.2.0’
using C++17
make[1]: Entering directory '/tmp/RtmpFs2iRX/R.INSTALLea03f5987b2c6/TDA/src'
/bin/sh: 1: clang++: not found
expr: syntax error: unexpected argument ‘50000’
g++-14 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I. -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -DBOOST_DISABLE_THREADS -DCGAL_EIGEN3_ENABLED -DCGAL_HEADER_ONLY -fpic -g -O2 -Wall -pedantic -mtune=native -c RcppExports.cpp -o RcppExports.o
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/Core:205,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/Dense:1,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/RcppEigenForward.h:28,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/RcppEigen.h:25,
from RcppExports.cpp:4:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes]
46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i;
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes]
47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b;
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes]
49 | template<> struct is_arithmetic<__m128> { enum { value = true }; };
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes]
50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; };
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes]
51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; };
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:222:43: warning: ignoring attributes on template argument ‘Eigen::internal::Packet4f’ {aka ‘__m128’} [-Wignored-attributes]
222 | template<> struct unpacket_traits<Packet4f> {
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:228:43: warning: ignoring attributes on template argument ‘Eigen::internal::Packet2d’ {aka ‘__m128d’} [-Wignored-attributes]
228 | template<> struct unpacket_traits<Packet2d> {
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:1124:34: warning: ignoring attributes on template argument ‘Eigen::internal::Packet4f’ {aka ‘__m128’} [-Wignored-attributes]
1124 | ptranspose(PacketBlock<Packet4f,4>& kernel) {
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:1129:34: warning: ignoring attributes on template argument ‘Eigen::internal::Packet2d’ {aka ‘__m128d’} [-Wignored-attributes]
1129 | ptranspose(PacketBlock<Packet2d,2>& kernel) {
| ^
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/Core:174:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/Default/ConjHelper.h:16:60: warning: ignoring attributes on template argument ‘Eigen::internal::Packet4f’ {aka ‘__m128’} [-Wignored-attributes]
16 | struct conj_helper<PACKET_REAL, PACKET_CPLX, false, false> { \
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’
173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/Default/ConjHelper.h:29:60: warning: ignoring attributes on template argument ‘Eigen::internal::Packet4f’ {aka ‘__m128’} [-Wignored-attributes]
29 | struct conj_helper<PACKET_CPLX, PACKET_REAL, false, false> { \
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’
173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/Default/ConjHelper.h:16:60: warning: ignoring attributes on template argument ‘Eigen::internal::Packet2d’ {aka ‘__m128d’} [-Wignored-attributes]
16 | struct conj_helper<PACKET_REAL, PACKET_CPLX, false, false> { \
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’
298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/Default/ConjHelper.h:29:60: warning: ignoring attributes on template argument ‘Eigen::internal::Packet2d’ {aka ‘__m128d’} [-Wignored-attributes]
29 | struct conj_helper<PACKET_CPLX, PACKET_REAL, false, false> { \
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’
298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/Core:165:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet<float, 4>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits<Eigen::Matrix<float, 4, 1> >’
22 | typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits<Eigen::Quaternion<float> >’
266 | Alignment = internal::traits<Coefficients>::Alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here
24 | ResAlignment = traits<Quaternion<float> >::Alignment
| ^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<float>::type’ {aka ‘__m128’} [-Wignored-attributes]
190 | bool Stop = Size==Dynamic || (Size%unpacket_traits<PacketType>::size)==0 || is_same<PacketType,typename unpacket_traits<PacketType>::half>::value>
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<float>::type’ {aka ‘__m128’} [-Wignored-attributes]
190 | bool Stop = Size==Dynamic || (Size%unpacket_traits<PacketType>::size)==0 || is_same<PacketType,typename unpacket_traits<PacketType>::half>::value>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<float>::type’ {aka ‘__m128’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<float>::type’ {aka ‘__m128’} [-Wignored-attributes]
208 | typedef typename find_best_packet_helper<Size,typename packet_traits<T>::type>::type type;
| ^~~~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/Core:271:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Matrix<float, 4, 1> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Matrix<float, 4, 1> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase<Eigen::Matrix<float, 4, 1> >’
98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix<float, 4, 1>’
178 | class Matrix
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase<Eigen::Quaternion<float> >’
46 | typedef typename Coefficients::CoeffReturnType CoeffReturnType;
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion<float>’
273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here
27 | {
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<float>::type’ {aka ‘__m128’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet<double, 4>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits<Eigen::Matrix<double, 4, 1> >’
22 | typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits<Eigen::Quaternion<double> >’
266 | Alignment = internal::traits<Coefficients>::Alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here
98 | ResAlignment = traits<Quaternion<double> >::Alignment
| ^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
190 | bool Stop = Size==Dynamic || (Size%unpacket_traits<PacketType>::size)==0 || is_same<PacketType,typename unpacket_traits<PacketType>::half>::value>
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
190 | bool Stop = Size==Dynamic || (Size%unpacket_traits<PacketType>::size)==0 || is_same<PacketType,typename unpacket_traits<PacketType>::half>::value>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
208 | typedef typename find_best_packet_helper<Size,typename packet_traits<T>::type>::type type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Matrix<double, 4, 1> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Matrix<double, 4, 1> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase<Eigen::Matrix<double, 4, 1> >’
98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix<double, 4, 1>’
178 | class Matrix
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase<Eigen::Quaternion<double> >’
46 | typedef typename Coefficients::CoeffReturnType CoeffReturnType;
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion<double>’
273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here
102 | {
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/SparseCore:37,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/Sparse:26,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/RcppEigenForward.h:29:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h: In instantiation of ‘class Eigen::SparseMatrixBase<Eigen::SparseMatrix<double, 0, int> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/SparseCore/SparseCompressedBase.h:36:7: required from ‘class Eigen::SparseCompressedBase<Eigen::SparseMatrix<double, 0, int> >’
36 | class SparseCompressedBase
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/SparseCore/SparseMatrix.h:96:7: required from ‘class Eigen::SparseMatrix<double, 0, int>’
96 | class SparseMatrix
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/unsupported/Eigen/src/IterativeSolvers/ConstrainedConjGrad.h:61:25: required from here
61 | typedef Triplet<double> T;
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/SparseCore/SparseMatrixBase.h:47:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
47 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
g++-14 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I. -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -DBOOST_DISABLE_THREADS -DCGAL_EIGEN3_ENABLED -DCGAL_HEADER_ONLY -fpic -g -O2 -Wall -pedantic -mtune=native -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 /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/parameter/aux_/is_tagged_argument.hpp:17,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/parameter/is_argument_pack.hpp:9,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/named_function_params.hpp:20,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:21,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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 /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/cstdfloat.hpp:27,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/multiprecision/detail/float128_functions.hpp:15,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/multiprecision/detail/fpclassify.hpp:13,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/multiprecision/detail/default_ops.hpp:15,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/multiprecision/detail/generic_interconvert.hpp:12,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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))
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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 /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/aux_/na_assert.hpp:23,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/arg.hpp:25,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/placeholders.hpp:24,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/iterator/iterator_categories.hpp:16,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/iterator/advance.hpp:12,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/next_prior.hpp:24,
from ./tdautils/ripsL2.h:3:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
| -
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
| -
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| -
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
| -
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:18,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/vector_property_map.hpp:14,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
361 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
| ^~~~~~~~
In file included from /usr/include/c++/14/memory:78,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/detail/shared_count.hpp:27:
/usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R >
| ^~~~~~~~
/usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
508 | explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
| ^~~~~~~~
/usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
521 | shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
| ^~~~~~~~
/usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
604 | shared_ptr & operator=( std::auto_ptr<Y> & r )
| ^~~~~~~~
/usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
613 | shared_ptr & operator=( std::auto_ptr<Y> && r )
| ^~~~~~~~
/usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
615 | this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
| ^~~~~~~~
/usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/bind/mem_fn.hpp:25,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/bind/bind.hpp:26,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/multi_index/detail/ord_index_impl.hpp:82,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/multi_index/ordered_index.hpp:17,
from ./topology/filtration.h:14:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/get_pointer.hpp: At global scope:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
| ^~~~~~~~
/usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/detail/requires_cxx11.hpp:9,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:17:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)))
| ^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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 /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/scoped_ptr.hpp:13,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/adjacency_list.hpp:22,
from ./topology/persistence-diagram.hpp:143:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
75 | explicit scoped_ptr( std::auto_ptr<T> p ) BOOST_SP_NOEXCEPT : px( p.release() )
| ^~~~~~~~
/usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/Core:205,
from ./gudhi/Alpha_complex/Alpha_kernel_d.h:16,
from ./gudhi/Alpha_complex.h:15:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:46:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes]
46 | typedef eigen_packet_wrapper<__m128i, 0> Packet4i;
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:47:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes]
47 | typedef eigen_packet_wrapper<__m128i, 1> Packet16b;
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:49:39: warning: ignoring attributes on template argument ‘__m128’ [-Wignored-attributes]
49 | template<> struct is_arithmetic<__m128> { enum { value = true }; };
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:50:40: warning: ignoring attributes on template argument ‘__m128i’ [-Wignored-attributes]
50 | template<> struct is_arithmetic<__m128i> { enum { value = true }; };
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:51:40: warning: ignoring attributes on template argument ‘__m128d’ [-Wignored-attributes]
51 | template<> struct is_arithmetic<__m128d> { enum { value = true }; };
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:222:43: warning: ignoring attributes on template argument ‘Eigen::internal::Packet4f’ {aka ‘__m128’} [-Wignored-attributes]
222 | template<> struct unpacket_traits<Packet4f> {
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:228:43: warning: ignoring attributes on template argument ‘Eigen::internal::Packet2d’ {aka ‘__m128d’} [-Wignored-attributes]
228 | template<> struct unpacket_traits<Packet2d> {
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:1124:34: warning: ignoring attributes on template argument ‘Eigen::internal::Packet4f’ {aka ‘__m128’} [-Wignored-attributes]
1124 | ptranspose(PacketBlock<Packet4f,4>& kernel) {
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/PacketMath.h:1129:34: warning: ignoring attributes on template argument ‘Eigen::internal::Packet2d’ {aka ‘__m128d’} [-Wignored-attributes]
1129 | ptranspose(PacketBlock<Packet2d,2>& kernel) {
| ^
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/Core:174:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/Default/ConjHelper.h:16:60: warning: ignoring attributes on template argument ‘Eigen::internal::Packet4f’ {aka ‘__m128’} [-Wignored-attributes]
16 | struct conj_helper<PACKET_REAL, PACKET_CPLX, false, false> { \
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’
173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/Default/ConjHelper.h:29:60: warning: ignoring attributes on template argument ‘Eigen::internal::Packet4f’ {aka ‘__m128’} [-Wignored-attributes]
29 | struct conj_helper<PACKET_CPLX, PACKET_REAL, false, false> { \
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:173:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’
173 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/Default/ConjHelper.h:16:60: warning: ignoring attributes on template argument ‘Eigen::internal::Packet2d’ {aka ‘__m128d’} [-Wignored-attributes]
16 | struct conj_helper<PACKET_REAL, PACKET_CPLX, false, false> { \
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’
298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/Default/ConjHelper.h:29:60: warning: ignoring attributes on template argument ‘Eigen::internal::Packet2d’ {aka ‘__m128d’} [-Wignored-attributes]
29 | struct conj_helper<PACKET_CPLX, PACKET_REAL, false, false> { \
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/arch/SSE/Complex.h:298:1: note: in expansion of macro ‘EIGEN_MAKE_CONJ_HELPER_CPLX_REAL’
298 | EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d)
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/Core:165:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet<float, 4>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits<Eigen::Matrix<float, 4, 1> >’
22 | typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits<Eigen::Quaternion<float> >’
266 | Alignment = internal::traits<Coefficients>::Alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:24:46: required from here
24 | ResAlignment = traits<Quaternion<float> >::Alignment
| ^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<float>::type’ {aka ‘__m128’} [-Wignored-attributes]
190 | bool Stop = Size==Dynamic || (Size%unpacket_traits<PacketType>::size)==0 || is_same<PacketType,typename unpacket_traits<PacketType>::half>::value>
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<float>::type’ {aka ‘__m128’} [-Wignored-attributes]
190 | bool Stop = Size==Dynamic || (Size%unpacket_traits<PacketType>::size)==0 || is_same<PacketType,typename unpacket_traits<PacketType>::half>::value>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<float>::type’ {aka ‘__m128’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(4) float>::half’ {aka ‘__m128’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<float>::type’ {aka ‘__m128’} [-Wignored-attributes]
208 | typedef typename find_best_packet_helper<Size,typename packet_traits<T>::type>::type type;
| ^~~~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/Core:271:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<float, 4, 1>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Matrix<float, 4, 1> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Matrix<float, 4, 1> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase<Eigen::Matrix<float, 4, 1> >’
98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix<float, 4, 1>’
178 | class Matrix
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase<Eigen::Quaternion<float> >’
46 | typedef typename Coefficients::CoeffReturnType CoeffReturnType;
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion<float>’
273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:27:3: required from here
27 | {
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<float>::type’ {aka ‘__m128’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet<double, 4>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits<Eigen::Matrix<double, 4, 1> >’
22 | typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:266:49: required from ‘struct Eigen::internal::traits<Eigen::Quaternion<double> >’
266 | Alignment = internal::traits<Coefficients>::Alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:98:47: required from here
98 | ResAlignment = traits<Quaternion<double> >::Alignment
| ^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
190 | bool Stop = Size==Dynamic || (Size%unpacket_traits<PacketType>::size)==0 || is_same<PacketType,typename unpacket_traits<PacketType>::half>::value>
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
190 | bool Stop = Size==Dynamic || (Size%unpacket_traits<PacketType>::size)==0 || is_same<PacketType,typename unpacket_traits<PacketType>::half>::value>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
208 | typedef typename find_best_packet_helper<Size,typename packet_traits<T>::type>::type type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 4, 1>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Matrix<double, 4, 1> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Matrix<double, 4, 1> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase<Eigen::Matrix<double, 4, 1> >’
98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix<double, 4, 1>’
178 | class Matrix
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:46:50: required from ‘class Eigen::QuaternionBase<Eigen::Quaternion<double> >’
46 | typedef typename Coefficients::CoeffReturnType CoeffReturnType;
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/Quaternion.h:273:7: required from ‘class Eigen::Quaternion<double>’
273 | class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> >
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Geometry/arch/Geometry_SIMD.h:102:3: required from here
102 | {
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
In file included from diag.cpp:30:
./alphaComplex.h: In function ‘void alphaComplexDiag(const RealMatrix&, unsigned int, unsigned int, int, const std::string&, bool, bool, const Print&, std::vector<std::vector<std::vector<double> > >&, std::vector<std::vector<std::vector<unsigned int> > >&, std::vector<std::vector<std::vector<std::vector<unsigned int> > > >&)’:
./alphaComplex.h:45:9: warning: typedef ‘using Point = CGAL::Kernel_d_interface<CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > >::Point_d’ locally defined but not used [-Wunused-local-typedefs]
45 | using Point = Kernel::Point_d;
| ^~~~~
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 /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/assert.hpp:35,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:19:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:31,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:20:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >)>’
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:152:13: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >)>’
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:278:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >)>’
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:278:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >)>’
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:281:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >)>’
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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
| ^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:191:13: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >)>’
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::forward_traversal_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:321:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >)>’
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:321:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >)>’
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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
| ^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:322:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >)>’
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:218:14: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >)>’
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::bidirectional_traversal_tag>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:355:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >)>’
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:355:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >)>’
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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> > >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:356:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >)>’
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/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(); }
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/size_type.hpp:20,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/size.hpp:21,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/functions.hpp:20,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/iterator_range_core.hpp:38,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/iterator_range.hpp:13,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/irange.hpp:16,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/detail/adjacency_list.hpp:21,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/adjacency_list.hpp:255:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet<double, -1>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Matrix.h:22:57: required from ‘struct Eigen::internal::traits<Eigen::Matrix<double, -1, -1> >’
22 | typedef typename find_best_packet<_Scalar,size>::type PacketScalar;
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1> >’
98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: required from ‘class Eigen::Matrix<double, -1, -1>’
178 | class Matrix
| ^~~~~~
./CGAL/NewKernel_d/function_objects_cartesian.h:659:14: required from ‘CGAL::CartesianDKernelFunctors::Construct_circumcenter<R_>::result_type CGAL::CartesianDKernelFunctors::Construct_circumcenter<R_>::operator()(Iter, Iter) const [with Iter = CGAL::transforming_iterator<CGAL::internal::Forward_rep, __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >, CGAL::Default, CGAL::Default>; R_ = CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>; result_type = std::vector<double>]’
659 | Matrix m(d,d);
| ^
./CGAL/NewKernel_d/function_objects_cartesian.h:733:17: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
190 | bool Stop = Size==Dynamic || (Size%unpacket_traits<PacketType>::size)==0 || is_same<PacketType,typename unpacket_traits<PacketType>::half>::value>
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
190 | bool Stop = Size==Dynamic || (Size%unpacket_traits<PacketType>::size)==0 || is_same<PacketType,typename unpacket_traits<PacketType>::half>::value>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
208 | typedef typename find_best_packet_helper<Size,typename packet_traits<T>::type>::type type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Matrix<double, -1, -1> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Matrix<double, -1, -1> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1> >’
98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, 1>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Matrix<double, -1, 1> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Matrix<double, -1, 1> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 1> >’
98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::PartialPivLU<Eigen::Matrix<double, -1, -1> >, Eigen::Matrix<double, -1, 1> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Solve<Eigen::PartialPivLU<Eigen::Matrix<double, -1, -1> >, Eigen::Matrix<double, -1, 1> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Solve<Eigen::PartialPivLU<Eigen::Matrix<double, -1, -1> >, Eigen::Matrix<double, -1, 1> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Solve.h:86:7: required from ‘class Eigen::SolveImpl<Eigen::PartialPivLU<Eigen::Matrix<double, -1, -1> >, Eigen::Matrix<double, -1, 1>, Eigen::Dense>’
86 | class SolveImpl<Decomposition,RhsType,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Solve.h:62:7: required from ‘class Eigen::Solve<Eigen::PartialPivLU<Eigen::Matrix<double, -1, -1> >, Eigen::Matrix<double, -1, 1> >’
62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
| ^~~~~
./CGAL/NewKernel_d/function_objects_cartesian.h:674:37: required from ‘CGAL::CartesianDKernelFunctors::Construct_circumcenter<R_>::result_type CGAL::CartesianDKernelFunctors::Construct_circumcenter<R_>::operator()(Iter, Iter) const [with Iter = CGAL::transforming_iterator<CGAL::internal::Forward_rep, __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >, CGAL::Default, CGAL::Default>; R_ = CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>; result_type = std::vector<double>]’
674 | Vec res=m.partialPivLu().solve(b);
| ~~~~~~~~~~~~~~~~~~~~~~^~~
./CGAL/NewKernel_d/function_objects_cartesian.h:733:17: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Solve<Eigen::LDLT<Eigen::Matrix<double, -1, -1>, 1>, Eigen::Matrix<double, -1, 1> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Solve<Eigen::LDLT<Eigen::Matrix<double, -1, -1>, 1>, Eigen::Matrix<double, -1, 1> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Solve<Eigen::LDLT<Eigen::Matrix<double, -1, -1>, 1>, Eigen::Matrix<double, -1, 1> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Solve.h:86:7: required from ‘class Eigen::SolveImpl<Eigen::LDLT<Eigen::Matrix<double, -1, -1>, 1>, Eigen::Matrix<double, -1, 1>, Eigen::Dense>’
86 | class SolveImpl<Decomposition,RhsType,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Solve.h:62:7: required from ‘class Eigen::Solve<Eigen::LDLT<Eigen::Matrix<double, -1, -1>, 1>, Eigen::Matrix<double, -1, 1> >’
62 | class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>
| ^~~~~
./CGAL/NewKernel_d/function_objects_cartesian.h:706:29: required from ‘CGAL::CartesianDKernelFunctors::Construct_circumcenter<R_>::result_type CGAL::CartesianDKernelFunctors::Construct_circumcenter<R_>::operator()(Iter, Iter) const [with Iter = CGAL::transforming_iterator<CGAL::internal::Forward_rep, __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >, CGAL::Default, CGAL::Default>; R_ = CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>; result_type = std::vector<double>]’
706 | Vec res=m.ldlt().solve(b);
| ~~~~~~~~~~~~~~^~~
./CGAL/NewKernel_d/function_objects_cartesian.h:733:17: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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
| ^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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
| ^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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>]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> >]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/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()
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7: required from ‘class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1>, Eigen::Dense>’
94 | class CwiseUnaryOpImpl
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7: required from ‘class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >’
55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:533:30: required from ‘void Eigen::PartialPivLU<MatrixType>::compute() [with _MatrixType = Eigen::Matrix<double, -1, -1>]’
533 | m_l1_norm = m_lu.cwiseAbs().colwise().sum().maxCoeff();
| ~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:133:14: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::PartialReduxExpr<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, Eigen::internal::member_sum<double, double>, 0>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::PartialReduxExpr<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, Eigen::internal::member_sum<double, double>, 0> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::PartialReduxExpr<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, Eigen::internal::member_sum<double, double>, 0> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:56:7: required from ‘class Eigen::PartialReduxExpr<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, Eigen::internal::member_sum<double, double>, 0>’
56 | class PartialReduxExpr : public internal::dense_xpr_base< PartialReduxExpr<MatrixType, MemberOp, Direction> >::type,
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:533:46: required from ‘void Eigen::PartialPivLU<MatrixType>::compute() [with _MatrixType = Eigen::Matrix<double, -1, -1>]’
533 | m_l1_norm = m_lu.cwiseAbs().colwise().sum().maxCoeff();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:133:14: required from ‘Eigen::PartialPivLU<MatrixType>& Eigen::PartialPivLU<MatrixType>::compute(const Eigen::EigenBase<OtherDerived>&) [with InputType = Eigen::Matrix<double, -1, -1>; _MatrixType = Eigen::Matrix<double, -1, -1>]’
133 | compute();
| ~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:315:10: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53: required from ‘class Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>’
63 | template<typename MatrixType, int _DiagIndex> class Diagonal
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:325:19: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7: required from ‘class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false>, Eigen::Dense>’
94 | class CwiseUnaryOpImpl
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7: required from ‘class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> >’
55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:325:43: required from ‘static bool Eigen::internal::ldlt_inplace<1>::unblocked(MatrixType&, TranspositionType&, Workspace&, Eigen::internal::SignMatrix&) [with MatrixType = Eigen::Matrix<double, -1, -1>; TranspositionType = Eigen::Transpositions<-1, -1, int>; Workspace = Eigen::Matrix<double, -1, 1>]’
325 | mat.diagonal().tail(size-k).cwiseAbs().maxCoeff(&index_of_biggest_in_corner);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:526:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl<const Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, Eigen::Dense>’
118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >’
52 | template<typename MatrixType> class Transpose
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:358:80: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::DiagonalWrapper<const Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> >, Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >, 1>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Product<Eigen::DiagonalWrapper<const Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> >, Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >, 1> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Product<Eigen::DiagonalWrapper<const Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> >, Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >, 1> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base<Eigen::DiagonalWrapper<const Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> >, Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >, 1, 7>’
120 | class dense_product_base
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl<Eigen::DiagonalWrapper<const Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> >, Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >, 1, Eigen::Dense>’
152 | class ProductImpl<Lhs,Rhs,Option,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product<Eigen::DiagonalWrapper<const Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> >, Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >, 1>’
71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
| ^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:358:67: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Product<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Product<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:126:7: required from ‘class Eigen::internal::dense_product_base<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0, 6>’
126 | class dense_product_base<Lhs, Rhs, Option, InnerProduct>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0, Eigen::Dense>’
152 | class ProductImpl<Lhs,Rhs,Option,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>’
71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
| ^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:359:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h: In instantiation of ‘struct Eigen::internal::find_best_packet<double, 1>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:179:81: required from ‘class Eigen::DenseBase<Eigen::Product<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0> >’
179 | typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar;
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Product<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:126:7: required from ‘class Eigen::internal::dense_product_base<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0, 6>’
126 | class dense_product_base<Lhs, Rhs, Option, InnerProduct>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0, Eigen::Dense>’
152 | class ProductImpl<Lhs,Rhs,Option,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>’
71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
| ^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:359:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:44: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
190 | bool Stop = Size==Dynamic || (Size%unpacket_traits<PacketType>::size)==0 || is_same<PacketType,typename unpacket_traits<PacketType>::half>::value>
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
190 | bool Stop = Size==Dynamic || (Size%unpacket_traits<PacketType>::size)==0 || is_same<PacketType,typename unpacket_traits<PacketType>::half>::value>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:190:83: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:208:88: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
208 | typedef typename find_best_packet_helper<Size,typename packet_traits<T>::type>::type type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Product<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Product<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0, 7>’
120 | class dense_product_base
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0, Eigen::Dense>’
152 | class ProductImpl<Lhs,Rhs,Option,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>’
71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
| ^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:361:32: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >’
39 | template<typename Derived> class ArrayBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7: required from ‘class Eigen::ArrayWrapper<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >’
42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:379:56: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, -1, 1> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, -1, 1> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, -1, 1> > >’
39 | template<typename Derived> class ArrayBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, -1, 1> >’
60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28: required from ‘struct Eigen::internal::traits<Eigen::CwiseBinaryOp<Eigen::internal::scalar_cmp_op<double, double, Eigen::internal::cmp_EQ>, const Eigen::ArrayWrapper<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, -1, 1> > > >’
38 | >::type Scalar;
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_cmp_op<double, double, Eigen::internal::cmp_EQ>, const Eigen::ArrayWrapper<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, -1, 1> >, Eigen::Dense>’
148 | class CwiseBinaryOpImpl
| ^~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::ArrayWrapper<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false> >, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::ArrayWrapper<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase<Eigen::ArrayWrapper<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false> > >’
39 | template<typename Derived> class ArrayBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ArrayWrapper.h:42:7: required from ‘class Eigen::ArrayWrapper<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false> >’
42 | class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> >
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:387:32: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7: required from ‘class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>, Eigen::Dense>’
94 | class CwiseUnaryOpImpl
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7: required from ‘class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >’
55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Dot.h:221:22: required from ‘static typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::internal::lpNorm_selector<Derived, 1>::run(const Eigen::MatrixBase<Derived>&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]’
221 | return m.cwiseAbs().sum();
| ~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Dot.h:269:52: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7: required from ‘class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false>, Eigen::Dense>’
94 | class CwiseUnaryOpImpl
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7: required from ‘class Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false> >’
55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Dot.h:221:22: required from ‘static typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::internal::lpNorm_selector<Derived, 1>::run(const Eigen::MatrixBase<Derived>&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]’
221 | return m.cwiseAbs().sum();
| ~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Dot.h:269:52: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Array<double, -1, 1>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Array<double, -1, 1>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Array<double, -1, 1>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Array<double, -1, 1> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ArrayBase.h:39:34: required from ‘class Eigen::ArrayBase<Eigen::Array<double, -1, 1> >’
39 | template<typename Derived> class ArrayBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase<Eigen::Array<double, -1, 1> >’
98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Array.h:45:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/Core:277:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1043:41: required from ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >’
1043 | CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1384:41: required from ‘struct Eigen::internal::evaluator_wrapper_base<Eigen::ArrayWrapper<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >’
1384 | CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1464:8: required from ‘struct Eigen::internal::unary_evaluator<Eigen::ArrayWrapper<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, double>’
1464 | struct unary_evaluator<ArrayWrapper<TArgType> >
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator<Eigen::ArrayWrapper<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >’
90 | struct evaluator : public unary_evaluator<T>
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::ArrayWrapper<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1384:41: required from ‘struct Eigen::internal::evaluator_wrapper_base<Eigen::ArrayWrapper<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >’
1384 | CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1464:8: required from ‘struct Eigen::internal::unary_evaluator<Eigen::ArrayWrapper<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, double>’
1464 | struct unary_evaluator<ArrayWrapper<TArgType> >
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator<Eigen::ArrayWrapper<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >’
90 | struct evaluator : public unary_evaluator<T>
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::ArrayWrapper<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41: required from ‘struct Eigen::internal::binary_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_cmp_op<double, double, Eigen::internal::cmp_EQ>, const Eigen::ArrayWrapper<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, -1, 1> > >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’
739 | CoeffReadCost = int(evaluator<Lhs>::CoeffReadCost) + int(evaluator<Rhs>::CoeffReadCost) + int(functor_traits<BinaryOp>::Cost),
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, -1, 1> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, -1, 1> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, -1, 1> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, -1, 1> >’
60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:41:67: required from ‘Derived& Eigen::DenseBase<Derived>::operator/=(const Scalar&) [with Derived = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false>; Scalar = double]’
41 | internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::div_assign_op<Scalar,Scalar>());
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:385:13: required from ‘static bool Eigen::internal::ldlt_inplace<1>::unblocked(MatrixType&, TranspositionType&, Workspace&, Eigen::internal::SignMatrix&) [with MatrixType = Eigen::Matrix<double, -1, -1>; TranspositionType = Eigen::Transpositions<-1, -1, int>; Workspace = Eigen::Matrix<double, -1, 1>]’
385 | A21 /= realAkk;
| ~~~~^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:526:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1384:41: required from ‘struct Eigen::internal::evaluator_wrapper_base<Eigen::ArrayWrapper<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false> > >’
1384 | CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1464:8: required from ‘struct Eigen::internal::unary_evaluator<Eigen::ArrayWrapper<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false> >, Eigen::internal::IndexBased, double>’
1464 | struct unary_evaluator<ArrayWrapper<TArgType> >
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator<Eigen::ArrayWrapper<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false> > >’
90 | struct evaluator : public unary_evaluator<T>
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::ArrayWrapper<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false> > >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41: required from ‘struct Eigen::internal::binary_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_cmp_op<double, double, Eigen::internal::cmp_EQ>, const Eigen::ArrayWrapper<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false> >, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Array<double, -1, 1> > >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’
739 | CoeffReadCost = int(evaluator<Lhs>::CoeffReadCost) + int(evaluator<Rhs>::CoeffReadCost) + int(functor_traits<BinaryOp>::Cost),
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<-1, 0> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<-1, 0> >, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<-1, 0> >, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<-1, 0> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<-1, 0> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::Stride<-1, 0> >, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Ref.h:44:50: required from ‘struct Eigen::internal::traits<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> > >::match<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false> >’
44 | DerivedAlignment = int(evaluator<Derived>::Alignment),
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Ref.h:288:101: required by substitution of ‘template<class Derived> Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >::Ref(const Eigen::DenseBase<Derived>&, typename Eigen::internal::enable_if<(bool)(Eigen::internal::traits<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> > >::match<Derived>::MatchAtCompileTime), Derived>::type*) [with Derived = Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>]’
288 | typename internal::enable_if<bool(Traits::template match<Derived>::MatchAtCompileTime),Derived>::type* = 0);
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:463:17: required from ‘static Eigen::Index Eigen::internal::partial_lu_impl<Scalar, StorageOrder, PivIndex, SizeAtCompileTime>::blocked_lu(Eigen::Index, Eigen::Index, Scalar*, Eigen::Index, PivIndex*, PivIndex&, Eigen::Index) [with Scalar = double; int StorageOrder = 0; PivIndex = int; int SizeAtCompileTime = -1; Eigen::Index = long int]’
463 | BlockType A_0 = lu.block(0,0,rows,k);
| ^~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:519:17: required from ‘void Eigen::internal::partial_lu_inplace(MatrixType&, TranspositionType&, typename TranspositionType::StorageIndex&) [with MatrixType = Eigen::Matrix<double, -1, -1>; TranspositionType = Eigen::Transpositions<-1, -1, int>; typename TranspositionType::StorageIndex = int]’
515 | partial_lu_impl
| ~~~~~~~~~~~~~~~
516 | < typename MatrixType::Scalar, MatrixType::Flags&RowMajorBit?RowMajor:ColMajor,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
517 | typename TranspositionType::StorageIndex,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
518 | EIGEN_SIZE_MIN_PREFER_FIXED(MatrixType::RowsAtCompileTime,MatrixType::ColsAtCompileTime)>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
519 | ::blocked_lu(lu.rows(), lu.cols(), &lu.coeffRef(0,0), lu.outerStride(), &row_transpositions.coeffRef(0), nb_transpositions);
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:543:31: required from ‘void Eigen::PartialPivLU<MatrixType>::compute() [with _MatrixType = Eigen::Matrix<double, -1, -1>]’
543 | internal::partial_lu_inplace(m_lu, m_rowsTranspositions, nb_transpositions);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:133:14: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Product<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Product<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0, 8>’
120 | class dense_product_base
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0, Eigen::Dense>’
152 | class ProductImpl<Lhs,Rhs,Option,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0>’
71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
| ^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:495:30: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::PermutationMatrix<-1, -1, int>, Eigen::Matrix<double, -1, 1>, 2>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Product<Eigen::PermutationMatrix<-1, -1, int>, Eigen::Matrix<double, -1, 1>, 2> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Product<Eigen::PermutationMatrix<-1, -1, int>, Eigen::Matrix<double, -1, 1>, 2> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base<Eigen::PermutationMatrix<-1, -1, int>, Eigen::Matrix<double, -1, 1>, 2, 7>’
120 | class dense_product_base
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl<Eigen::PermutationMatrix<-1, -1, int>, Eigen::Matrix<double, -1, 1>, 2, Eigen::Dense>’
152 | class ProductImpl<Lhs,Rhs,Option,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product<Eigen::PermutationMatrix<-1, -1, int>, Eigen::Matrix<double, -1, 1>, 2>’
71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
| ^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:234:28: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, 1, 0, 1, 1>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, 1, 0, 1, 1>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, 1, 1, 0, 1, 1>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Matrix<double, 1, 1, 0, 1, 1> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Matrix<double, 1, 1, 0, 1, 1> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase<Eigen::Matrix<double, 1, 1, 0, 1, 1> >’
98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:167:44: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_score_coeff_op<double>, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_score_coeff_op<double>, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::CwiseUnaryOp<Eigen::internal::scalar_score_coeff_op<double>, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:94:7: required from ‘class Eigen::CwiseUnaryOpImpl<Eigen::internal::scalar_score_coeff_op<double>, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, Eigen::Dense>’
94 | class CwiseUnaryOpImpl
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseUnaryOp.h:55:7: required from ‘class Eigen::CwiseUnaryOp<Eigen::internal::scalar_score_coeff_op<double>, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >’
55 | class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:377:43: required from ‘static Eigen::Index Eigen::internal::partial_lu_impl<Scalar, StorageOrder, PivIndex, SizeAtCompileTime>::unblocked_lu(MatrixTypeRef&, PivIndex*, PivIndex&) [with Scalar = double; int StorageOrder = 0; PivIndex = int; int SizeAtCompileTime = -1; Eigen::Index = long int; MatrixTypeRef = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >]’
377 | = lu.col(k).tail(rows-k).unaryExpr(Scoring()).maxCoeff(&row_of_biggest_in_col);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:439:26: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>, 0>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>, 0> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>, 0> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>, 0, 5>’
120 | class dense_product_base
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>, 0, Eigen::Dense>’
152 | class ProductImpl<Lhs,Rhs,Option,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>, 0>’
71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
| ^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:400:114: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1043:41: required from ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false> >’
1043 | CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false> >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:564:45: required from ‘struct Eigen::internal::unary_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false> >, Eigen::internal::IndexBased, double>’
564 | CoeffReadCost = int(evaluator<ArgType>::CoeffReadCost) + int(functor_traits<UnaryOp>::Cost),
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false> > >’
90 | struct evaluator : public unary_evaluator<T>
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:357:7: required from ‘class Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false> > >’
357 | class redux_evaluator : public internal::evaluator<_XprType>
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:414:17: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false> >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:564:45: required from ‘struct Eigen::internal::unary_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false> >, Eigen::internal::IndexBased, double>’
564 | CoeffReadCost = int(evaluator<ArgType>::CoeffReadCost) + int(functor_traits<UnaryOp>::Cost),
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false> > >’
90 | struct evaluator : public unary_evaluator<T>
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:357:7: required from ‘class Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false> > >’
357 | class redux_evaluator : public internal::evaluator<_XprType>
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:414:17: required from ‘typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op<double, double>; Derived = Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>, 1, -1, false> >; typename Eigen::internal::traits<T>::Scalar = double]’
414 | ThisEvaluator thisEval(derived());
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:564:45: required from ‘struct Eigen::internal::unary_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> >, Eigen::internal::IndexBased, double>’
564 | CoeffReadCost = int(evaluator<ArgType>::CoeffReadCost) + int(functor_traits<UnaryOp>::Cost),
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> > >’
90 | struct evaluator : public unary_evaluator<T>
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Visitor.h:79:51: required from ‘class Eigen::internal::visitor_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> > >’
79 | CoeffReadCost = internal::evaluator<XprType>::CoeffReadCost
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Visitor.h:123:17: required from ‘void Eigen::DenseBase<Derived>::visit(Visitor&) const [with Visitor = Eigen::internal::max_coeff_visitor<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> >, 0>; Derived = Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Diagonal<Eigen::Matrix<double, -1, -1>, 0>, -1, 1, false> >]’
123 | ThisEvaluator thisEval(derived());
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Visitor.h:374:14: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102: required from ‘struct Eigen::internal::plain_object_eval<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Dense>’
372 | typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:369:45: required from ‘struct Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>’
369 | typedef typename nested_eval<Lhs,1>::type LhsNested;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42: required from ‘static void Eigen::internal::Assignment<DstXprType, Eigen::Product<Lhs, Rhs, Options>, Eigen::internal::sub_assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense, typename Eigen::internal::enable_if<((Options == Eigen::DefaultProduct) || (Options == Eigen::AliasFreeProduct))>::type>::run(DstXprType&, const SrcXprType&, const Eigen::internal::sub_assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false>; Lhs = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; int Options = 0; Scalar = double; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>]’
178 | generic_product_impl<Lhs, Rhs>::subTo(dst, src.lhs(), src.rhs());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49: required from ‘void Eigen::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false>; Src = Eigen::Product<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>; Func = sub_assign_op<double, double>]’
890 | Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/NoAlias.h:59:31: required from ‘ExpressionType& Eigen::NoAlias<ExpressionType, StorageBase>::operator-=(const StorageBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>; ExpressionType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false>; StorageBase = Eigen::MatrixBase]’
59 | call_assignment_no_alias(m_expression, other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:361:25: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102: required from ‘struct Eigen::internal::plain_object_eval<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, Eigen::Dense>’
372 | typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:370:45: required from ‘struct Eigen::internal::generic_product_impl<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, Eigen::DenseShape, Eigen::DenseShape, 7>’
370 | typedef typename nested_eval<Rhs,1>::type RhsNested;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42: required from ‘static void Eigen::internal::Assignment<DstXprType, Eigen::Product<Lhs, Rhs, Options>, Eigen::internal::sub_assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense, typename Eigen::internal::enable_if<((Options == Eigen::DefaultProduct) || (Options == Eigen::AliasFreeProduct))>::type>::run(DstXprType&, const SrcXprType&, const Eigen::internal::sub_assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false>; Lhs = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; int Options = 0; Scalar = double; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>]’
178 | generic_product_impl<Lhs, Rhs>::subTo(dst, src.lhs(), src.rhs());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49: required from ‘void Eigen::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false>; Src = Eigen::Product<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>; Func = sub_assign_op<double, double>]’
890 | Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/NoAlias.h:59:31: required from ‘ExpressionType& Eigen::NoAlias<ExpressionType, StorageBase>::operator-=(const StorageBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, 0>; ExpressionType = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false>; StorageBase = Eigen::MatrixBase]’
59 | call_assignment_no_alias(m_expression, other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:361:25: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpositions<-1, -1, int>, Eigen::Matrix<double, -1, 1>, 2>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Product<Eigen::Transpositions<-1, -1, int>, Eigen::Matrix<double, -1, 1>, 2> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Product<Eigen::Transpositions<-1, -1, int>, Eigen::Matrix<double, -1, 1>, 2> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base<Eigen::Transpositions<-1, -1, int>, Eigen::Matrix<double, -1, 1>, 2, 7>’
120 | class dense_product_base
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl<Eigen::Transpositions<-1, -1, int>, Eigen::Matrix<double, -1, 1>, 2, Eigen::Dense>’
152 | class ProductImpl<Lhs,Rhs,Option,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product<Eigen::Transpositions<-1, -1, int>, Eigen::Matrix<double, -1, 1>, 2>’
71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
| ^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:577:26: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, -1, -1>, 0>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Diagonal<const Eigen::Matrix<double, -1, -1>, 0>, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Diagonal<const Eigen::Matrix<double, -1, -1>, 0> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Diagonal<const Eigen::Matrix<double, -1, -1>, 0> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Diagonal.h:63:53: required from ‘class Eigen::Diagonal<const Eigen::Matrix<double, -1, -1>, 0>’
63 | template<typename MatrixType, int _DiagIndex> class Diagonal
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:587:61: required from ‘void Eigen::LDLT<MatrixType, UpLo>::_solve_impl_transposed(const RhsType&, DstType&) const [with bool Conjugate = true; RhsType = Eigen::Matrix<double, -1, 1>; DstType = Eigen::Matrix<double, -1, 1>; _MatrixType = Eigen::Matrix<double, -1, -1>; int _UpLo = 1]’
587 | const typename Diagonal<const MatrixType>::RealReturnType vecD(vectorD());
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:569:31: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1> >, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Matrix<double, -1, -1> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl<const Eigen::Matrix<double, -1, -1>, Eigen::Dense>’
118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose<const Eigen::Matrix<double, -1, -1> >’
52 | template<typename MatrixType> class Transpose
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:175:44: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Transpose<Eigen::TranspositionsBase<Eigen::Transpositions<-1, -1, int> > >, Eigen::Matrix<double, -1, 1>, 2>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Product<Eigen::Transpose<Eigen::TranspositionsBase<Eigen::Transpositions<-1, -1, int> > >, Eigen::Matrix<double, -1, 1>, 2> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Product<Eigen::Transpose<Eigen::TranspositionsBase<Eigen::Transpositions<-1, -1, int> > >, Eigen::Matrix<double, -1, 1>, 2> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base<Eigen::Transpose<Eigen::TranspositionsBase<Eigen::Transpositions<-1, -1, int> > >, Eigen::Matrix<double, -1, 1>, 2, 7>’
120 | class dense_product_base
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl<Eigen::Transpose<Eigen::TranspositionsBase<Eigen::Transpositions<-1, -1, int> > >, Eigen::Matrix<double, -1, 1>, 2, Eigen::Dense>’
152 | class ProductImpl<Lhs,Rhs,Option,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product<Eigen::Transpose<Eigen::TranspositionsBase<Eigen::Transpositions<-1, -1, int> > >, Eigen::Matrix<double, -1, 1>, 2>’
71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
| ^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:610:38: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 1, 1, 0, 1, 1> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 1, 1, 0, 1, 1> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 1, 1, 0, 1, 1> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 1, 1, 0, 1, 1> >’
60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:41:67: required from ‘Derived& Eigen::DenseBase<Derived>::operator/=(const Scalar&) [with Derived = Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>; Scalar = double]’
41 | internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::div_assign_op<Scalar,Scalar>());
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:599:18: required from ‘void Eigen::LDLT<MatrixType, UpLo>::_solve_impl_transposed(const RhsType&, DstType&) const [with bool Conjugate = true; RhsType = Eigen::Matrix<double, -1, 1>; DstType = Eigen::Matrix<double, -1, 1>; _MatrixType = Eigen::Matrix<double, -1, -1>; int _UpLo = 1]’
599 | dst.row(i) /= vecD(i);
| ~~~~~~~~~~~^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:569:31: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> >, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> >, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 16, Eigen::Stride<0, 0> >, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase<Derived>&) [with Derived = Eigen::CwiseUnaryOp<scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >; Eigen::Index = long int]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl<Func, Evaluator, 3, 0>::Scalar Eigen::internal::redux_impl<Func, Evaluator, 3, 0>::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> > >; Scalar = double]’
243 | const Index alignedStart = internal::first_default_aligned(xpr);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op<double, double>; Derived = Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]’
418 | return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::sum() const [with Derived = Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >; typename Eigen::internal::traits<T>::Scalar = double]’
463 | return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Dot.h:221:28: required from ‘static typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::internal::lpNorm_selector<Derived, 1>::run(const Eigen::MatrixBase<Derived>&) [with Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]’
221 | return m.cwiseAbs().sum();
| ~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Dot.h:269:52: required from ‘typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real Eigen::MatrixBase<Derived>::lpNorm() const [with int p = 1; Derived = Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false>; typename Eigen::NumTraits<typename Eigen::internal::traits<T>::Scalar>::Real = double; typename Eigen::internal::traits<T>::Scalar = double]’
269 | return internal::lpNorm_selector<Derived, p>::run(*this);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:514:74: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
654 | return internal::first_aligned<int(unpacket_traits<DefaultPacketType>::alignment),Derived>(m);
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >, const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >, const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >, const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >, const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, Eigen::Dense>’
148 | class CwiseBinaryOpImpl
| ^~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false> >, const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false> >’
77 | class CwiseBinaryOp :
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:251:54: required from ‘static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::DenseShape, 6>::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix<double, 1, 1, 0, 1, 1>; Lhs = Eigen::Block<Eigen::Matrix<double, -1, -1>, 1, -1, false>; Rhs = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>]’
251 | dst.coeffRef(0,0) = (lhs.transpose().cwiseProduct(rhs)).sum();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:124:75: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1043:41: required from ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >’
1043 | CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:564:45: required from ‘struct Eigen::internal::unary_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_score_coeff_op<double>, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, double>’
564 | CoeffReadCost = int(evaluator<ArgType>::CoeffReadCost) + int(functor_traits<UnaryOp>::Cost),
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_score_coeff_op<double>, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> > >’
90 | struct evaluator : public unary_evaluator<T>
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Visitor.h:79:51: required from ‘class Eigen::internal::visitor_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_score_coeff_op<double>, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> > >’
79 | CoeffReadCost = internal::evaluator<XprType>::CoeffReadCost
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Visitor.h:123:17: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:564:45: required from ‘struct Eigen::internal::unary_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_score_coeff_op<double>, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, double>’
564 | CoeffReadCost = int(evaluator<ArgType>::CoeffReadCost) + int(functor_traits<UnaryOp>::Cost),
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_score_coeff_op<double>, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> > >’
90 | struct evaluator : public unary_evaluator<T>
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Visitor.h:79:51: required from ‘class Eigen::internal::visitor_evaluator<Eigen::CwiseUnaryOp<Eigen::internal::scalar_score_coeff_op<double>, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> > >’
79 | CoeffReadCost = internal::evaluator<XprType>::CoeffReadCost
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Visitor.h:123:17: required from ‘void Eigen::DenseBase<Derived>::visit(Visitor&) const [with Visitor = Eigen::internal::max_coeff_visitor<Eigen::CwiseUnaryOp<Eigen::internal::scalar_score_coeff_op<double>, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >, 0>; Derived = Eigen::CwiseUnaryOp<Eigen::internal::scalar_score_coeff_op<double>, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >]’
123 | ThisEvaluator thisEval(derived());
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Visitor.h:374:14: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/Core:330:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘class Eigen::internal::gebp_traits<double, double, false, false, 1, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/TriangularSolverMatrix.h:64:27: required from ‘static void Eigen::internal::triangular_solve_matrix<Scalar, Index, 1, Mode, Conjugate, TriStorageOrder, 0, OtherInnerStride>::run(Index, Index, const Scalar*, Index, Scalar*, Index, Index, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long int; int Mode = 5; bool Conjugate = false; int TriStorageOrder = 0; int OtherInnerStride = 1]’
64 | SmallPanelWidth = EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr),
| ^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:102:12: required from ‘static void Eigen::internal::triangular_solver_selector<Lhs, Rhs, Side, Mode, 0, -1>::run(const Lhs&, Rhs&) [with Lhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; int Side = 1; int Mode = 5]’
100 | triangular_solve_matrix<Scalar,Index,Side,Mode,LhsProductTraits::NeedToConjugate,(int(Lhs::Flags) & RowMajorBit) ? RowMajor : ColMajor,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
101 | (Rhs::Flags&RowMajorBit) ? RowMajor : ColMajor, Rhs::InnerStrideAtCompileTime>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | ::run(size, othersize, &actualLhs.coeffRef(0,0), actualLhs.outerStride(), &rhs.coeffRef(0,0), rhs.innerStride(), rhs.outerStride(), blocking);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:182:21: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with int Side = 1; OtherDerived = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; _MatrixType = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]’
181 | internal::triangular_solver_selector<MatrixType, typename internal::remove_reference<OtherCopy>::type,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
182 | Side, Mode>::run(derived().nestedExpression(), otherCopy);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:522:37: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; _MatrixType = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]’
522 | { return solveInPlace<OnTheLeft>(other); }
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:493:62: required from ‘static Eigen::Index Eigen::internal::partial_lu_impl<Scalar, StorageOrder, PivIndex, SizeAtCompileTime>::blocked_lu(Eigen::Index, Eigen::Index, Scalar*, Eigen::Index, PivIndex*, PivIndex&, Eigen::Index) [with Scalar = double; int StorageOrder = 0; PivIndex = int; int SizeAtCompileTime = -1; Eigen::Index = long int]’
493 | A11.template triangularView<UnitLower>().solveInPlace(A12);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:519:17: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable,
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable,
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
433 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1,
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
434 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1,
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
435 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1,
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
460 | typedef typename conditional<Vectorizable,_LhsPacket,LhsScalar>::type LhsPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
461 | typedef typename conditional<Vectorizable,_RhsPacket,RhsScalar>::type RhsPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
462 | typedef typename conditional<Vectorizable,_ResPacket,ResScalar>::type ResPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
465 | typedef QuadPacket<RhsPacket> RhsPacketx4;
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘class Eigen::internal::gebp_traits<double, double, false, false, 1, 1>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1080:42: required from ‘struct Eigen::internal::gebp_kernel<double, double, long int, Eigen::internal::blas_data_mapper<double, long int, 0, 0, 1>, 4, 4, false, false>’
1080 | typedef typename HalfTraits::LhsPacket LhsPacketHalf;
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/TriangularSolverMatrix.h:78:95: required from ‘static void Eigen::internal::triangular_solve_matrix<Scalar, Index, 1, Mode, Conjugate, TriStorageOrder, 0, OtherInnerStride>::run(Index, Index, const Scalar*, Index, Scalar*, Index, Index, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long int; int Mode = 5; bool Conjugate = false; int TriStorageOrder = 0; int OtherInnerStride = 1]’
78 | gebp_kernel<Scalar, Scalar, Index, OtherMapper, Traits::mr, Traits::nr, Conjugate, false> gebp_kernel;
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:102:12: required from ‘static void Eigen::internal::triangular_solver_selector<Lhs, Rhs, Side, Mode, 0, -1>::run(const Lhs&, Rhs&) [with Lhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; int Side = 1; int Mode = 5]’
100 | triangular_solve_matrix<Scalar,Index,Side,Mode,LhsProductTraits::NeedToConjugate,(int(Lhs::Flags) & RowMajorBit) ? RowMajor : ColMajor,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
101 | (Rhs::Flags&RowMajorBit) ? RowMajor : ColMajor, Rhs::InnerStrideAtCompileTime>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | ::run(size, othersize, &actualLhs.coeffRef(0,0), actualLhs.outerStride(), &rhs.coeffRef(0,0), rhs.innerStride(), rhs.outerStride(), blocking);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:182:21: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with int Side = 1; OtherDerived = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; _MatrixType = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]’
181 | internal::triangular_solver_selector<MatrixType, typename internal::remove_reference<OtherCopy>::type,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
182 | Side, Mode>::run(derived().nestedExpression(), otherCopy);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:522:37: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; _MatrixType = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]’
522 | { return solveInPlace<OnTheLeft>(other); }
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:493:62: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable,
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable,
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
433 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1,
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
434 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1,
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
435 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1,
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
460 | typedef typename conditional<Vectorizable,_LhsPacket,LhsScalar>::type LhsPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
461 | typedef typename conditional<Vectorizable,_RhsPacket,RhsScalar>::type RhsPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
462 | typedef typename conditional<Vectorizable,_ResPacket,ResScalar>::type ResPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
465 | typedef QuadPacket<RhsPacket> RhsPacketx4;
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘class Eigen::internal::gebp_traits<double, double, false, false, 1, 2>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1085:45: required from ‘struct Eigen::internal::gebp_kernel<double, double, long int, Eigen::internal::blas_data_mapper<double, long int, 0, 0, 1>, 4, 4, false, false>’
1085 | typedef typename QuarterTraits::LhsPacket LhsPacketQuarter;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/TriangularSolverMatrix.h:78:95: required from ‘static void Eigen::internal::triangular_solve_matrix<Scalar, Index, 1, Mode, Conjugate, TriStorageOrder, 0, OtherInnerStride>::run(Index, Index, const Scalar*, Index, Scalar*, Index, Index, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long int; int Mode = 5; bool Conjugate = false; int TriStorageOrder = 0; int OtherInnerStride = 1]’
78 | gebp_kernel<Scalar, Scalar, Index, OtherMapper, Traits::mr, Traits::nr, Conjugate, false> gebp_kernel;
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:102:12: required from ‘static void Eigen::internal::triangular_solver_selector<Lhs, Rhs, Side, Mode, 0, -1>::run(const Lhs&, Rhs&) [with Lhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; int Side = 1; int Mode = 5]’
100 | triangular_solve_matrix<Scalar,Index,Side,Mode,LhsProductTraits::NeedToConjugate,(int(Lhs::Flags) & RowMajorBit) ? RowMajor : ColMajor,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
101 | (Rhs::Flags&RowMajorBit) ? RowMajor : ColMajor, Rhs::InnerStrideAtCompileTime>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | ::run(size, othersize, &actualLhs.coeffRef(0,0), actualLhs.outerStride(), &rhs.coeffRef(0,0), rhs.innerStride(), rhs.outerStride(), blocking);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:182:21: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with int Side = 1; OtherDerived = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; _MatrixType = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]’
181 | internal::triangular_solver_selector<MatrixType, typename internal::remove_reference<OtherCopy>::type,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
182 | Side, Mode>::run(derived().nestedExpression(), otherCopy);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:522:37: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; _MatrixType = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]’
522 | { return solveInPlace<OnTheLeft>(other); }
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:493:62: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:425:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
425 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:426:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
426 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:427:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
427 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:384:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
384 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable,
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:49: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
432 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable && unpacket_traits<_RhsPacket>::vectorizable,
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:432:94: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
433 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1,
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:433:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
434 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1,
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:434:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
435 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1,
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:435:65: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
460 | typedef typename conditional<Vectorizable,_LhsPacket,LhsScalar>::type LhsPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:460:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
461 | typedef typename conditional<Vectorizable,_RhsPacket,RhsScalar>::type RhsPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:461:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
462 | typedef typename conditional<Vectorizable,_ResPacket,ResScalar>::type ResPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:462:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
465 | typedef QuadPacket<RhsPacket> RhsPacketx4;
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:465:33: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Map.h:94:79: required from ‘class Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >’
94 | template<typename PlainObjectType, int MapOptions, typename StrideType> class Map
| ^~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/TriangularSolverVector.h:97:18: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true, true>’
329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false, true>’
329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseNullaryOp.h:60:7: required from ‘class Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >’
60 | class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:38:28: required from ‘struct Eigen::internal::traits<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> > >’
38 | >::type Scalar;
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, Eigen::Dense>’
148 | class CwiseBinaryOpImpl
| ^~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, Eigen::Dense>’
148 | class CwiseBinaryOpImpl
| ^~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >’
77 | class CwiseBinaryOp :
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/TriangularSolverVector.h:125:66: required from ‘static void Eigen::internal::triangular_solve_vector<LhsScalar, RhsScalar, Index, 1, Mode, Conjugate, 0>::run(Index, const LhsScalar*, Index, RhsScalar*) [with LhsScalar = double; RhsScalar = double; Index = long int; int Mode = 5; bool Conjugate = false]’
125 | Map<Matrix<RhsScalar,Dynamic,1> >(rhs+s,r) -= rhs[i] * cjLhs.col(i).segment(s,r);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:73:12: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/Core:333:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of ‘class Eigen::internal::gemv_traits<double, double, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:87:38: required from ‘struct Eigen::internal::general_matrix_vector_product<long int, double, Eigen::internal::const_blas_data_mapper<double, long int, 0>, 0, false, double, Eigen::internal::const_blas_data_mapper<double, long int, 0>, false, 0>’
87 | typedef typename Traits::LhsPacket LhsPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/TriangularSolverVector.h:134:115: required from ‘static void Eigen::internal::triangular_solve_vector<LhsScalar, RhsScalar, Index, 1, Mode, Conjugate, 0>::run(Index, const LhsScalar*, Index, RhsScalar*) [with LhsScalar = double; RhsScalar = double; Index = long int; int Mode = 5; bool Conjugate = false]’
134 | general_matrix_vector_product<Index,LhsScalar,LhsMapper,ColMajor,Conjugate,RhsScalar,RhsMapper,false>::run(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
135 | r, actualPanelWidth,
| ~~~~~~~~~~~~~~~~~~~~
136 | LhsMapper(&lhs.coeffRef(endBlock,startBlock), lhsStride),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
137 | RhsMapper(rhs+startBlock, 1),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
138 | rhs+endBlock, 1, RhsScalar(-1));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:73:12: required from ‘static void Eigen::internal::triangular_solver_selector<Lhs, Rhs, Side, Mode, 0, 1>::run(const Lhs&, Rhs&) [with Lhs = const Eigen::Matrix<double, -1, -1>; Rhs = Eigen::Matrix<double, -1, 1>; int Side = 1; int Mode = 5]’
71 | triangular_solve_vector<LhsScalar, RhsScalar, Index, Side, Mode, LhsProductTraits::NeedToConjugate,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
72 | (int(Lhs::Flags) & RowMajorBit) ? RowMajor : ColMajor>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
73 | ::run(actualLhs.cols(), actualLhs.data(), actualLhs.outerStride(), actualRhs);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:182:21: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with int Side = 1; OtherDerived = Eigen::Matrix<double, -1, 1>; _MatrixType = const Eigen::Matrix<double, -1, -1>; unsigned int _Mode = 5]’
181 | internal::triangular_solver_selector<MatrixType, typename internal::remove_reference<OtherCopy>::type,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
182 | Side, Mode>::run(derived().nestedExpression(), otherCopy);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:522:37: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Matrix<double, -1, 1>; _MatrixType = const Eigen::Matrix<double, -1, -1>; unsigned int _Mode = 5]’
522 | { return solveInPlace<OnTheLeft>(other); }
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:237:61: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
51 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable &&
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
52 | unpacket_traits<_RhsPacket>::vectorizable &&
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size),
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size),
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
54 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1,
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
55 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1,
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
56 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
59 | typedef typename conditional<Vectorizable,_LhsPacket,LhsScalar>::type LhsPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
60 | typedef typename conditional<Vectorizable,_RhsPacket,RhsScalar>::type RhsPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
61 | typedef typename conditional<Vectorizable,_ResPacket,ResScalar>::type ResPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of ‘class Eigen::internal::gemv_traits<double, double, 1>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:91:42: required from ‘struct Eigen::internal::general_matrix_vector_product<long int, double, Eigen::internal::const_blas_data_mapper<double, long int, 0>, 0, false, double, Eigen::internal::const_blas_data_mapper<double, long int, 0>, false, 0>’
91 | typedef typename HalfTraits::LhsPacket LhsPacketHalf;
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/TriangularSolverVector.h:134:115: required from ‘static void Eigen::internal::triangular_solve_vector<LhsScalar, RhsScalar, Index, 1, Mode, Conjugate, 0>::run(Index, const LhsScalar*, Index, RhsScalar*) [with LhsScalar = double; RhsScalar = double; Index = long int; int Mode = 5; bool Conjugate = false]’
134 | general_matrix_vector_product<Index,LhsScalar,LhsMapper,ColMajor,Conjugate,RhsScalar,RhsMapper,false>::run(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
135 | r, actualPanelWidth,
| ~~~~~~~~~~~~~~~~~~~~
136 | LhsMapper(&lhs.coeffRef(endBlock,startBlock), lhsStride),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
137 | RhsMapper(rhs+startBlock, 1),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
138 | rhs+endBlock, 1, RhsScalar(-1));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:73:12: required from ‘static void Eigen::internal::triangular_solver_selector<Lhs, Rhs, Side, Mode, 0, 1>::run(const Lhs&, Rhs&) [with Lhs = const Eigen::Matrix<double, -1, -1>; Rhs = Eigen::Matrix<double, -1, 1>; int Side = 1; int Mode = 5]’
71 | triangular_solve_vector<LhsScalar, RhsScalar, Index, Side, Mode, LhsProductTraits::NeedToConjugate,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
72 | (int(Lhs::Flags) & RowMajorBit) ? RowMajor : ColMajor>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
73 | ::run(actualLhs.cols(), actualLhs.data(), actualLhs.outerStride(), actualRhs);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:182:21: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with int Side = 1; OtherDerived = Eigen::Matrix<double, -1, 1>; _MatrixType = const Eigen::Matrix<double, -1, -1>; unsigned int _Mode = 5]’
181 | internal::triangular_solver_selector<MatrixType, typename internal::remove_reference<OtherCopy>::type,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
182 | Side, Mode>::run(derived().nestedExpression(), otherCopy);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:522:37: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Matrix<double, -1, 1>; _MatrixType = const Eigen::Matrix<double, -1, -1>; unsigned int _Mode = 5]’
522 | { return solveInPlace<OnTheLeft>(other); }
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:237:61: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
51 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable &&
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
52 | unpacket_traits<_RhsPacket>::vectorizable &&
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size),
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size),
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
54 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1,
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
55 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1,
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
56 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
59 | typedef typename conditional<Vectorizable,_LhsPacket,LhsScalar>::type LhsPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
60 | typedef typename conditional<Vectorizable,_RhsPacket,RhsScalar>::type RhsPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
61 | typedef typename conditional<Vectorizable,_ResPacket,ResScalar>::type ResPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h: In instantiation of ‘class Eigen::internal::gemv_traits<double, double, 2>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:95:45: required from ‘struct Eigen::internal::general_matrix_vector_product<long int, double, Eigen::internal::const_blas_data_mapper<double, long int, 0>, 0, false, double, Eigen::internal::const_blas_data_mapper<double, long int, 0>, false, 0>’
95 | typedef typename QuarterTraits::LhsPacket LhsPacketQuarter;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/TriangularSolverVector.h:134:115: required from ‘static void Eigen::internal::triangular_solve_vector<LhsScalar, RhsScalar, Index, 1, Mode, Conjugate, 0>::run(Index, const LhsScalar*, Index, RhsScalar*) [with LhsScalar = double; RhsScalar = double; Index = long int; int Mode = 5; bool Conjugate = false]’
134 | general_matrix_vector_product<Index,LhsScalar,LhsMapper,ColMajor,Conjugate,RhsScalar,RhsMapper,false>::run(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
135 | r, actualPanelWidth,
| ~~~~~~~~~~~~~~~~~~~~
136 | LhsMapper(&lhs.coeffRef(endBlock,startBlock), lhsStride),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
137 | RhsMapper(rhs+startBlock, 1),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
138 | rhs+endBlock, 1, RhsScalar(-1));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:73:12: required from ‘static void Eigen::internal::triangular_solver_selector<Lhs, Rhs, Side, Mode, 0, 1>::run(const Lhs&, Rhs&) [with Lhs = const Eigen::Matrix<double, -1, -1>; Rhs = Eigen::Matrix<double, -1, 1>; int Side = 1; int Mode = 5]’
71 | triangular_solve_vector<LhsScalar, RhsScalar, Index, Side, Mode, LhsProductTraits::NeedToConjugate,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
72 | (int(Lhs::Flags) & RowMajorBit) ? RowMajor : ColMajor>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
73 | ::run(actualLhs.cols(), actualLhs.data(), actualLhs.outerStride(), actualRhs);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:182:21: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with int Side = 1; OtherDerived = Eigen::Matrix<double, -1, 1>; _MatrixType = const Eigen::Matrix<double, -1, -1>; unsigned int _Mode = 5]’
181 | internal::triangular_solver_selector<MatrixType, typename internal::remove_reference<OtherCopy>::type,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
182 | Side, Mode>::run(derived().nestedExpression(), otherCopy);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:522:37: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Matrix<double, -1, 1>; _MatrixType = const Eigen::Matrix<double, -1, -1>; unsigned int _Mode = 5]’
522 | { return solveInPlace<OnTheLeft>(other); }
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:237:61: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:44:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
44 | PACKET_DECL_COND_PREFIX(_, Lhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:45:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
45 | PACKET_DECL_COND_PREFIX(_, Rhs, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:46:27: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
46 | PACKET_DECL_COND_PREFIX(_, Res, _PacketSize);
| ^
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:42:3: note: in definition of macro ‘PACKET_DECL_COND_PREFIX’
42 | prefix ## name ## Packet
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
51 | Vectorizable = unpacket_traits<_LhsPacket>::vectorizable &&
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:51:53: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
52 | unpacket_traits<_RhsPacket>::vectorizable &&
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:52:38: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size),
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:42: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
53 | int(unpacket_traits<_LhsPacket>::size)==int(unpacket_traits<_RhsPacket>::size),
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:53:82: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
54 | LhsPacketSize = Vectorizable ? unpacket_traits<_LhsPacket>::size : 1,
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:54:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
55 | RhsPacketSize = Vectorizable ? unpacket_traits<_RhsPacket>::size : 1,
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:55:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
56 | ResPacketSize = Vectorizable ? unpacket_traits<_ResPacket>::size : 1
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:56:69: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
59 | typedef typename conditional<Vectorizable,_LhsPacket,LhsScalar>::type LhsPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:59:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
60 | typedef typename conditional<Vectorizable,_RhsPacket,RhsScalar>::type RhsPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:60:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
61 | typedef typename conditional<Vectorizable,_ResPacket,ResScalar>::type ResPacket;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixVector.h:61:73: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false>, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false, true>’
329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true>, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true, true>’
329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, -1, 1, true>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, -1, 1, true> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, -1, 1, true> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:172:103: required from ‘class Eigen::internal::BlockImpl_dense<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, -1, 1, true, false>’
172 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:154:7: required from ‘class Eigen::BlockImpl<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, -1, 1, true, Eigen::Dense>’
154 | class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:103:81: required from ‘class Eigen::Block<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, -1, 1, true>’
103 | template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block
| ^~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/PartialReduxEvaluator.h:183:72: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:774:20: required from ‘void Eigen::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>; SrcXprType = Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>; Functor = swap_assign_op<double>]’
774 | SrcEvaluatorType srcEvaluator(src);
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment<DstXprType, SrcXprType, Functor, Eigen::internal::Dense2Dense, Weak>::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>; SrcXprType = Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>; Functor = Eigen::internal::swap_assign_op<double>; Weak = void]’
954 | call_dense_assignment_loop(dst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49: required from ‘void Eigen::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>; Src = Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>; Func = swap_assign_op<double>]’
890 | Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:858:27: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing<Src>::value), void*>::type) [with Dst = Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>; Src = Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>; Func = swap_assign_op<double>; typename enable_if<(! evaluator_assume_aliasing<Src>::value), void*>::type = void*; typename evaluator_traits<SrcXprType>::Shape = Eigen::DenseShape]’
858 | call_assignment_no_alias(dst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:424:22: required from ‘void Eigen::DenseBase<Derived>::swap(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>; Derived = Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>]’
424 | call_assignment(derived(), other.const_cast_derived(), internal::swap_assign_op<Scalar>());
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:483:24: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘void Eigen::internal::gemm_pack_rhs<Scalar, Index, DataMapper, nr, 0, Conjugate, PanelMode>::operator()(Scalar*, const DataMapper&, Index, Index, Index, Index) [with Scalar = double; Index = long int; DataMapper = Eigen::internal::blas_data_mapper<double, long int, 0, 0, 1>; int nr = 4; bool Conjugate = false; bool PanelMode = true]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/TriangularSolverMatrix.h:155:19: required from ‘static void Eigen::internal::triangular_solve_matrix<Scalar, Index, 1, Mode, Conjugate, TriStorageOrder, 0, OtherInnerStride>::run(Index, Index, const Scalar*, Index, Scalar*, Index, Index, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long int; int Mode = 5; bool Conjugate = false; int TriStorageOrder = 0; int OtherInnerStride = 1]’
155 | pack_rhs(blockB+actual_kc*j2, other.getSubMapper(startBlock,j2), actualPanelWidth, actual_cols, actual_kc, blockBOffset);
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:102:12: required from ‘static void Eigen::internal::triangular_solver_selector<Lhs, Rhs, Side, Mode, 0, -1>::run(const Lhs&, Rhs&) [with Lhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; int Side = 1; int Mode = 5]’
100 | triangular_solve_matrix<Scalar,Index,Side,Mode,LhsProductTraits::NeedToConjugate,(int(Lhs::Flags) & RowMajorBit) ? RowMajor : ColMajor,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
101 | (Rhs::Flags&RowMajorBit) ? RowMajor : ColMajor, Rhs::InnerStrideAtCompileTime>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | ::run(size, othersize, &actualLhs.coeffRef(0,0), actualLhs.outerStride(), &rhs.coeffRef(0,0), rhs.innerStride(), rhs.outerStride(), blocking);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:182:21: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with int Side = 1; OtherDerived = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; _MatrixType = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]’
181 | internal::triangular_solver_selector<MatrixType, typename internal::remove_reference<OtherCopy>::type,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
182 | Side, Mode>::run(derived().nestedExpression(), otherCopy);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:522:37: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; _MatrixType = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]’
522 | { return solveInPlace<OnTheLeft>(other); }
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:493:62: required from ‘static Eigen::Index Eigen::internal::partial_lu_impl<Scalar, StorageOrder, PivIndex, SizeAtCompileTime>::blocked_lu(Eigen::Index, Eigen::Index, Scalar*, Eigen::Index, PivIndex*, PivIndex&, Eigen::Index) [with Scalar = double; int StorageOrder = 0; PivIndex = int; int SizeAtCompileTime = -1; Eigen::Index = long int]’
493 | A11.template triangularView<UnitLower>().solveInPlace(A12);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:519:17: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2459:62: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
2459 | PacketBlock<Packet,(PacketSize%4)==0?4:PacketSize> kernel;
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘void Eigen::internal::gemm_pack_lhs<Scalar, Index, DataMapper, Pack1, Pack2, Packet, 0, Conjugate, PanelMode>::operator()(Scalar*, const DataMapper&, Index, Index, Index, Index) [with Scalar = double; Index = long int; DataMapper = Eigen::internal::const_blas_data_mapper<double, long int, 0>; int Pack1 = 4; int Pack2 = 2; Packet = __vector(2) double; bool Conjugate = false; bool PanelMode = false]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/TriangularSolverMatrix.h:162:21: required from ‘static void Eigen::internal::triangular_solve_matrix<Scalar, Index, 1, Mode, Conjugate, TriStorageOrder, 0, OtherInnerStride>::run(Index, Index, const Scalar*, Index, Scalar*, Index, Index, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long int; int Mode = 5; bool Conjugate = false; int TriStorageOrder = 0; int OtherInnerStride = 1]’
162 | pack_lhs(blockA, tri.getSubMapper(startTarget,startBlock), actualPanelWidth, lengthTarget);
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:102:12: required from ‘static void Eigen::internal::triangular_solver_selector<Lhs, Rhs, Side, Mode, 0, -1>::run(const Lhs&, Rhs&) [with Lhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; int Side = 1; int Mode = 5]’
100 | triangular_solve_matrix<Scalar,Index,Side,Mode,LhsProductTraits::NeedToConjugate,(int(Lhs::Flags) & RowMajorBit) ? RowMajor : ColMajor,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
101 | (Rhs::Flags&RowMajorBit) ? RowMajor : ColMajor, Rhs::InnerStrideAtCompileTime>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | ::run(size, othersize, &actualLhs.coeffRef(0,0), actualLhs.outerStride(), &rhs.coeffRef(0,0), rhs.innerStride(), rhs.outerStride(), blocking);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:182:21: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with int Side = 1; OtherDerived = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; _MatrixType = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]’
181 | internal::triangular_solver_selector<MatrixType, typename internal::remove_reference<OtherCopy>::type,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
182 | Side, Mode>::run(derived().nestedExpression(), otherCopy);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:522:37: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; _MatrixType = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]’
522 | { return solveInPlace<OnTheLeft>(other); }
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:493:62: required from ‘static Eigen::Index Eigen::internal::partial_lu_impl<Scalar, StorageOrder, PivIndex, SizeAtCompileTime>::blocked_lu(Eigen::Index, Eigen::Index, Scalar*, Eigen::Index, PivIndex*, PivIndex&, Eigen::Index) [with Scalar = double; int StorageOrder = 0; PivIndex = int; int SizeAtCompileTime = -1; Eigen::Index = long int]’
493 | A11.template triangularView<UnitLower>().solveInPlace(A12);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:519:17: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2100:82: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
2100 | typedef typename unpacket_traits<typename unpacket_traits<Packet>::half>::half QuarterPacket;
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2102:56: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
2102 | HalfPacketSize = unpacket_traits<HalfPacket>::size,
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2103:62: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
2103 | QuarterPacketSize = unpacket_traits<QuarterPacket>::size,
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2103:62: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘void Eigen::internal::gebp_kernel<LhsScalar, RhsScalar, Index, DataMapper, mr, nr, ConjugateLhs, ConjugateRhs>::operator()(const DataMapper&, const LhsScalar*, const RhsScalar*, Index, Index, Index, ResScalar, Index, Index, Index, Index) [with LhsScalar = double; RhsScalar = double; Index = long int; DataMapper = Eigen::internal::blas_data_mapper<double, long int, 0, 0, 1>; int mr = 4; int nr = 4; bool ConjugateLhs = false; bool ConjugateRhs = false; ResScalar = double]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/TriangularSolverMatrix.h:164:24: required from ‘static void Eigen::internal::triangular_solve_matrix<Scalar, Index, 1, Mode, Conjugate, TriStorageOrder, 0, OtherInnerStride>::run(Index, Index, const Scalar*, Index, Scalar*, Index, Index, Eigen::internal::level3_blocking<Scalar, Scalar>&) [with Scalar = double; Index = long int; int Mode = 5; bool Conjugate = false; int TriStorageOrder = 0; int OtherInnerStride = 1]’
164 | gebp_kernel(other.getSubMapper(startTarget,j2), blockA, blockB+actual_kc*j2, lengthTarget, actualPanelWidth, actual_cols, Scalar(-1),
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
165 | actualPanelWidth, actual_kc, 0, blockBOffset);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:102:12: required from ‘static void Eigen::internal::triangular_solver_selector<Lhs, Rhs, Side, Mode, 0, -1>::run(const Lhs&, Rhs&) [with Lhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; int Side = 1; int Mode = 5]’
100 | triangular_solve_matrix<Scalar,Index,Side,Mode,LhsProductTraits::NeedToConjugate,(int(Lhs::Flags) & RowMajorBit) ? RowMajor : ColMajor,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
101 | (Rhs::Flags&RowMajorBit) ? RowMajor : ColMajor, Rhs::InnerStrideAtCompileTime>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | ::run(size, othersize, &actualLhs.coeffRef(0,0), actualLhs.outerStride(), &rhs.coeffRef(0,0), rhs.innerStride(), rhs.outerStride(), blocking);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:182:21: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with int Side = 1; OtherDerived = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; _MatrixType = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]’
181 | internal::triangular_solver_selector<MatrixType, typename internal::remove_reference<OtherCopy>::type,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
182 | Side, Mode>::run(derived().nestedExpression(), otherCopy);
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/TriangularMatrix.h:522:37: required from ‘void Eigen::TriangularViewImpl<_MatrixType, _Mode, Eigen::Dense>::solveInPlace(const Eigen::MatrixBase<OtherDerived>&) const [with OtherDerived = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; _MatrixType = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; unsigned int _Mode = 5]’
522 | { return solveInPlace<OnTheLeft>(other); }
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:493:62: required from ‘static Eigen::Index Eigen::internal::partial_lu_impl<Scalar, StorageOrder, PivIndex, SizeAtCompileTime>::blocked_lu(Eigen::Index, Eigen::Index, Scalar*, Eigen::Index, PivIndex*, PivIndex&, Eigen::Index) [with Scalar = double; int StorageOrder = 0; PivIndex = int; int SizeAtCompileTime = -1; Eigen::Index = long int]’
493 | A11.template triangularView<UnitLower>().solveInPlace(A12);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:519:17: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1920:103: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
1920 | const int SResPacketHalfSize = unpacket_traits<typename unpacket_traits<SResPacket>::half>::size;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1921:138: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
1921 | const int SResPacketQuarterSize = unpacket_traits<typename unpacket_traits<typename unpacket_traits<SResPacket>::half>::half>::size;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1921:138: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1977:135: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
1977 | typedef typename conditional<SwappedTraits::LhsProgress>=8,typename unpacket_traits<SResPacket>::half,SResPacket>::type SResPacketHalf;
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1978:135: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
1978 | typedef typename conditional<SwappedTraits::LhsProgress>=8,typename unpacket_traits<SLhsPacket>::half,SLhsPacket>::type SLhsPacketHalf;
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1979:135: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
1979 | typedef typename conditional<SwappedTraits::LhsProgress>=8,typename unpacket_traits<SRhsPacket>::half,SRhsPacket>::type SRhsPacketHalf;
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1980:135: warning: ignoring attributes on template argument ‘Eigen::internal::unpacket_traits<__vector(2) double>::half’ {aka ‘__m128d’} [-Wignored-attributes]
1980 | typedef typename conditional<SwappedTraits::LhsProgress>=8,typename unpacket_traits<SAccPacket>::half,SAccPacket>::type SAccPacketHalf;
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 0>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Product<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 0> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Product<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 0> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 0, 7>’
120 | class dense_product_base
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 0, Eigen::Dense>’
152 | class ProductImpl<Lhs,Rhs,Option,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 0>’
71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
| ^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:345:45: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true, true>’
329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102: required from ‘struct Eigen::internal::plain_object_eval<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, Eigen::Dense>’
372 | typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:370:45: required from ‘struct Eigen::internal::generic_product_impl<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, Eigen::DenseShape, Eigen::DenseShape, 7>’
370 | typedef typename nested_eval<Rhs,1>::type RhsNested;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:479:24: required from ‘static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::DenseShape, 8>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Lhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Scalar = double]’
478 | return internal::generic_product_impl<Lhs,typename Rhs::ConstColXpr,DenseShape,DenseShape,GemvProduct>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
479 | ::scaleAndAddTo(dst_vec, a_lhs, a_rhs.col(0), alpha);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:464:20: required from ‘static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::DenseShape, 8>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Lhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >]’
464 | scaleAndAddTo(dst, lhs, rhs, Scalar(-1));
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Product<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Product<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Product<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0, 7>’
120 | class dense_product_base
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0, Eigen::Dense>’
152 | class ProductImpl<Lhs,Rhs,Option,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 0>’
71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
| ^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:345:45: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false, true>’
329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/util/XprHelper.h:372:102: required from ‘struct Eigen::internal::plain_object_eval<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, Eigen::Dense>’
372 | typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type;
| ^~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:369:45: required from ‘struct Eigen::internal::generic_product_impl<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::DenseShape, Eigen::DenseShape, 7>’
369 | typedef typename nested_eval<Lhs,1>::type LhsNested;
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:486:24: required from ‘static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::DenseShape, 8>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Lhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Scalar = double]’
485 | return internal::generic_product_impl<typename Lhs::ConstRowXpr,Rhs,DenseShape,DenseShape,GemvProduct>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
486 | ::scaleAndAddTo(dst_vec, a_lhs.row(0), a_rhs, alpha);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:464:20: required from ‘static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::DenseShape, 8>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Lhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >]’
464 | scaleAndAddTo(dst, lhs, rhs, Scalar(-1));
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 2, Eigen::Stride<0, 0> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 2, Eigen::Stride<0, 0> >, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 2, Eigen::Stride<0, 0> >, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 2, Eigen::Stride<0, 0> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 2, Eigen::Stride<0, 0> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Map<Eigen::Matrix<double, -1, 1>, 2, Eigen::Stride<0, 0> >, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1>, 2, Eigen::Stride<0, 0> > >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1>, 2, Eigen::Stride<0, 0> > > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1>, 2, Eigen::Stride<0, 0> > > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1>, 2, Eigen::Stride<0, 0> >, Eigen::Dense>’
148 | class CwiseBinaryOpImpl
| ^~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Map<Eigen::Matrix<double, -1, 1>, 2, Eigen::Stride<0, 0> > >’
77 | class CwiseBinaryOp :
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:296:40: required from ‘static void Eigen::internal::gemv_dense_selector<2, 0, true>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; Rhs = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Dest = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, false>; typename Dest::Scalar = double]’
296 | dest.matrix() += actualAlpha * MappedDest(actualDestPtr, dest.size());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:388:34: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Matrix<double, -1, -1, 1, -1, -1> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Matrix<double, -1, -1, 1, -1, -1> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/PlainObjectBase.h:98:7: required from ‘class Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 1, -1, -1> >’
98 | class PlainObjectBase : public internal::dense_xpr_base<Derived>::type
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Matrix.h:178:7: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Map.h:94:79: required from ‘class Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >’
94 | template<typename PlainObjectType, int MapOptions, typename StrideType> class Map
| ^~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/TriangularSolverVector.h:39:18: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true, true>’
329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false>, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false, true>’
329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false>, Eigen::Dense>’
118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >’
52 | template<typename MatrixType> class Transpose
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/TriangularSolverVector.h:78:57: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Map.h:94:79: required from ‘class Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >’
94 | template<typename PlainObjectType, int MapOptions, typename StrideType> class Map
| ^~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/TriangularSolverVector.h:78:73: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >, const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >, const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >, const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >, const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >, Eigen::Dense>’
148 | class CwiseBinaryOpImpl
| ^~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >, const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > >’
77 | class CwiseBinaryOp :
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/TriangularSolverVector.h:78:72: required from ‘static void Eigen::internal::triangular_solve_vector<LhsScalar, RhsScalar, Index, 1, Mode, Conjugate, 1>::run(Index, const LhsScalar*, Index, RhsScalar*) [with LhsScalar = double; RhsScalar = double; Index = long int; int Mode = 6; bool Conjugate = false]’
78 | rhs[i] -= (cjLhs.row(i).segment(s,k).transpose().cwiseProduct(Map<const Matrix<RhsScalar,Dynamic,1> >(rhs+s,k))).sum();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:73:12: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:274:18: required from ‘void Eigen::internal::outer_product_selector_run(Dst&, const Lhs&, const Rhs&, const Func&, const false_type&) [with Dst = Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>; Lhs = Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>; Rhs = Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>; Func = generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>, Eigen::DenseShape, Eigen::DenseShape, 5>::sub]’
274 | evaluator<Rhs> rhsEval(rhs);
| ^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:329:41: required from ‘static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::DenseShape, 5>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>; Lhs = Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>; Rhs = Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>]’
329 | internal::outer_product_selector_run(dst, lhs, rhs, sub(), is_row_major<Dst>());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42: required from ‘static void Eigen::internal::Assignment<DstXprType, Eigen::Product<Lhs, Rhs, Options>, Eigen::internal::sub_assign_op<Scalar, Scalar>, Eigen::internal::Dense2Dense, typename Eigen::internal::enable_if<((Options == Eigen::DefaultProduct) || (Options == Eigen::AliasFreeProduct))>::type>::run(DstXprType&, const SrcXprType&, const Eigen::internal::sub_assign_op<Scalar, Scalar>&) [with DstXprType = Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>; Lhs = Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>; Rhs = Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>; int Options = 0; Scalar = double; SrcXprType = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>, 0>]’
178 | generic_product_impl<Lhs, Rhs>::subTo(dst, src.lhs(), src.rhs());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49: required from ‘void Eigen::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>; Src = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>, 0>; Func = sub_assign_op<double, double>]’
890 | Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/NoAlias.h:59:31: required from ‘ExpressionType& Eigen::NoAlias<ExpressionType, StorageBase>::operator-=(const StorageBase<OtherDerived>&) [with OtherDerived = Eigen::Product<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>, 0>; ExpressionType = Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>; StorageBase = Eigen::MatrixBase]’
59 | call_assignment_no_alias(m_expression, other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/LU/PartialPivLU.h:400:77: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>, -1, 1, true>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>, -1, 1, true>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>, -1, 1, true>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>, -1, 1, true> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>, -1, 1, true> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>, -1, 1, true>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, Eigen::Dense>’
148 | class CwiseBinaryOpImpl
| ^~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >’
77 | class CwiseBinaryOp :
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:280:48: required from ‘void Eigen::internal::outer_product_selector_run(Dst&, const Lhs&, const Rhs&, const Func&, const false_type&) [with Dst = Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>; Lhs = Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>; Rhs = Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>; Func = generic_product_impl<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false>, Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, false>, Eigen::DenseShape, Eigen::DenseShape, 5>::sub]’
280 | func(dst.col(j), rhsEval.coeff(Index(0),j) * actual_lhs);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:329:41: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Product<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Product<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Product<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:120:7: required from ‘class Eigen::internal::dense_product_base<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, 8>’
120 | class dense_product_base
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:152:7: required from ‘class Eigen::ProductImpl<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, Eigen::Dense>’
152 | class ProductImpl<Lhs,Rhs,Option,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Product.h:71:7: required from ‘class Eigen::Product<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1>’
71 | class Product : public ProductImpl<_Lhs,_Rhs,Option,
| ^~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:462:68: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true>, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true, true>’
329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true>, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true, true>’
329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false>, Eigen::Dense>’
118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >’
52 | template<typename MatrixType> class Transpose
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Dot.h:50:23: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true>, Eigen::Dense>’
148 | class CwiseBinaryOpImpl
| ^~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true> >’
77 | class CwiseBinaryOp :
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Dot.h:50:56: required from ‘static Eigen::internal::dot_nocheck<T, U, true>::ResScalar Eigen::internal::dot_nocheck<T, U, true>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false>; U = Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true>; ResScalar = double]’
50 | return a.transpose().template binaryExpr<conj_prod>(b).sum();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Dot.h:84:58: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:780:20: required from ‘void Eigen::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>; SrcXprType = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, 1, 1, 0, 1, 1> >; Functor = div_assign_op<double, double>]’
780 | DstEvaluatorType dstEvaluator(dst);
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment<DstXprType, SrcXprType, Functor, Eigen::internal::Dense2Dense, Weak>::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>; SrcXprType = Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, Eigen::Matrix<double, 1, 1, 0, 1, 1> >; Functor = Eigen::internal::div_assign_op<double, double>; Weak = void]’
954 | call_dense_assignment_loop(dst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49: required from ‘void Eigen::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>; Src = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, 1, 1, 0, 1, 1> >; Func = div_assign_op<double, double>]’
890 | Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:858:27: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing<Src>::value), void*>::type) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>; Src = Eigen::CwiseNullaryOp<scalar_constant_op<double>, Eigen::Matrix<double, 1, 1, 0, 1, 1> >; Func = div_assign_op<double, double>; typename enable_if<(! evaluator_assume_aliasing<Src>::value), void*>::type = void*; typename evaluator_traits<SrcXprType>::Shape = Eigen::DenseShape]’
858 | call_assignment_no_alias(dst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SelfCwiseBinaryOp.h:41:28: required from ‘Derived& Eigen::DenseBase<Derived>::operator/=(const Scalar&) [with Derived = Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>; Scalar = double]’
41 | internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::div_assign_op<Scalar,Scalar>());
| ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Cholesky/LDLT.h:599:18: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Transpose<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Transpose<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Transpose<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, Eigen::Dense>’
118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> > >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> > >, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Transpose<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> > > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> > > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Dense>’
118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> > >’
52 | template<typename MatrixType> class Transpose
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:207:26: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, Eigen::Dense>’
118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >’
52 | template<typename MatrixType> class Transpose
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/GeneralProduct.h:207:43: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true> >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1043:41: required from ‘struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >’
1043 | CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41: required from ‘struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >, Eigen::internal::IndexBased, double>’
311 | CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> > >’
90 | struct evaluator : public unary_evaluator<T>
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: [ skipping 20 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41: required from ‘struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >, Eigen::internal::IndexBased, double>’
311 | CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> > >’
90 | struct evaluator : public unary_evaluator<T>
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> > >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41: required from ‘struct Eigen::internal::binary_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >, const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’
739 | CoeffReadCost = int(evaluator<Lhs>::CoeffReadCost) + int(evaluator<Rhs>::CoeffReadCost) + int(functor_traits<BinaryOp>::Cost),
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, -1, 1, true> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:357:7: required from ‘class Eigen::internal::redux_evaluator<Eigen::Block<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, -1, 1, true> >’
357 | class redux_evaluator : public internal::evaluator<_XprType>
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:414:17: required from ‘typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op<double, double>; Derived = Eigen::Block<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, -1, 1, true>; typename Eigen::internal::traits<T>::Scalar = double]’
414 | ThisEvaluator thisEval(derived());
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::sum() const [with Derived = Eigen::Block<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, -1, 1, true>; typename Eigen::internal::traits<T>::Scalar = double]’
463 | return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:114:1: required from ‘ResultType Eigen::internal::member_sum<ResultType, Scalar>::operator()(const XprType&) const [with XprType = Eigen::Block<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, -1, 1, true>; ResultType = double; Scalar = double]’
97 | { return mat.MEMBER(); } \
| ~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/PartialReduxEvaluator.h:183:21: required from ‘const Eigen::internal::evaluator<Eigen::PartialReduxExpr<MatrixType, MemberOp, Direction> >::Scalar Eigen::internal::evaluator<Eigen::PartialReduxExpr<MatrixType, MemberOp, Direction> >::coeff(Eigen::Index) const [with ArgType = const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >; MemberOp = Eigen::internal::member_sum<double, double>; int Direction = 0; Scalar = double; Eigen::Index = long int]’
183 | return m_functor(m_arg.template subVector<DirectionType(Direction)>(index));
| ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/PartialReduxEvaluator.h:177:17: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true>, Eigen::Dense>’
148 | class CwiseBinaryOpImpl
| ^~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true> >’
77 | class CwiseBinaryOp :
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Dot.h:50:56: required from ‘static Eigen::internal::dot_nocheck<T, U, true>::ResScalar Eigen::internal::dot_nocheck<T, U, true>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>; U = Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true>; ResScalar = double]’
50 | return a.transpose().template binaryExpr<conj_prod>(b).sum();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Dot.h:84:58: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> >, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Transpose.h:118:37: required from ‘class Eigen::TransposeImpl<const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true>, Eigen::Dense>’
118 | template<typename MatrixType> class TransposeImpl<MatrixType,Dense>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Transpose.h:52:37: required from ‘class Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> >’
52 | template<typename MatrixType> class Transpose
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Dot.h:50:23: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, Eigen::Dense>’
148 | class CwiseBinaryOpImpl
| ^~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> >’
77 | class CwiseBinaryOp :
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Dot.h:50:56: required from ‘static Eigen::internal::dot_nocheck<T, U, true>::ResScalar Eigen::internal::dot_nocheck<T, U, true>::run(const Eigen::MatrixBase<Derived>&, const Eigen::MatrixBase<U>&) [with T = Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true>; U = Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>; ResScalar = double]’
50 | return a.transpose().template binaryExpr<conj_prod>(b).sum();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Dot.h:84:58: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, -1, 1, true>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, -1, 1, true>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, -1, 1, true>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, -1, 1, true> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, -1, 1, true> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<Eigen::Transpose<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, -1, 1, true>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, 1>, 1, 1, false>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:481:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<const Eigen::Matrix<double, -1, 1>, 1, 1, false>, 2>’
481 | class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<const Eigen::Matrix<double, -1, 1>, 1, 1, false> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<const Eigen::Matrix<double, -1, 1>, 1, 1, false> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<const Eigen::Matrix<double, -1, 1>, 1, 1, false>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:329:7: required from ‘class Eigen::internal::BlockImpl_dense<const Eigen::Matrix<double, -1, 1>, 1, 1, false, true>’
329 | class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Block.h:154:7: [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41: required from ‘struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >, Eigen::internal::IndexBased, double>’
311 | CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> > >’
90 | struct evaluator : public unary_evaluator<T>
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> > >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41: required from ‘struct Eigen::internal::binary_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’
739 | CoeffReadCost = int(evaluator<Lhs>::CoeffReadCost) + int(evaluator<Rhs>::CoeffReadCost) + int(functor_traits<BinaryOp>::Cost),
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true> >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:78: required from ‘struct Eigen::internal::binary_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’
739 | CoeffReadCost = int(evaluator<Lhs>::CoeffReadCost) + int(evaluator<Rhs>::CoeffReadCost) + int(functor_traits<BinaryOp>::Cost),
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: required from ‘struct Eigen::internal::evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true> > >’
722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:357:7: required from ‘class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true> > >’
357 | class redux_evaluator : public internal::evaluator<_XprType>
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:414:17: required from ‘typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op<double, double>; Derived = Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, 1, -1, false> >, const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]’
414 | ThisEvaluator thisEval(derived());
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘void Eigen::internal::gemm_pack_rhs<Scalar, Index, DataMapper, nr, 0, Conjugate, PanelMode>::operator()(Scalar*, const DataMapper&, Index, Index, Index, Index) [with Scalar = double; Index = long int; DataMapper = Eigen::internal::const_blas_data_mapper<double, long int, 0>; int nr = 4; bool Conjugate = false; bool PanelMode = false]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:195:21: required from ‘static void Eigen::internal::general_matrix_matrix_product<Index, LhsScalar, LhsStorageOrder, ConjugateLhs, RhsScalar, RhsStorageOrder, ConjugateRhs, 0, ResInnerStride>::run(Index, Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, Index, ResScalar, Eigen::internal::level3_blocking<LhsScalar, RhsScalar>&, Eigen::internal::GemmParallelInfo<Index>*) [with Index = long int; LhsScalar = double; int LhsStorageOrder = 0; bool ConjugateLhs = false; RhsScalar = double; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; ResScalar = double]’
195 | pack_rhs(blockB, rhs.getSubMapper(k2,j2), actual_kc, actual_nc);
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:230:14: required from ‘void Eigen::internal::gemm_functor<Scalar, Index, Gemm, Lhs, Rhs, Dest, BlockingType>::operator()(Index, Index, Index, Index, Eigen::internal::GemmParallelInfo<Index>*) const [with Scalar = double; Index = long int; Gemm = Eigen::internal::general_matrix_matrix_product<long int, double, 0, false, double, 0, false, 0, 1>; Lhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Dest = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; BlockingType = Eigen::internal::gemm_blocking_space<0, double, double, -1, -1, -1, 1, false>]’
230 | Gemm::run(rows, cols, m_lhs.cols(),
| ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
231 | &m_lhs.coeffRef(row,0), m_lhs.outerStride(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
232 | &m_rhs.coeffRef(0,col), m_rhs.outerStride(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
233 | (Scalar*)&(m_dest.coeffRef(row,col)), m_dest.innerStride(), m_dest.outerStride(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
234 | m_actualAlpha, m_blocking, info);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/Parallelizer.h:114:7: required from ‘void Eigen::internal::parallelize_gemm(const Functor&, Index, Index, Index, bool) [with bool Condition = true; Functor = gemm_functor<double, long int, general_matrix_matrix_product<long int, double, 0, false, double, 0, false, 0, 1>, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, gemm_blocking_space<0, double, double, -1, -1, -1, 1, false> >; Index = long int]’
114 | func(0,rows, 0,cols);
| ~~~~^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:509:9: required from ‘static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::DenseShape, 8>::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Lhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Scalar = double]’
508 | internal::parallelize_gemm<(Dest::MaxRowsAtCompileTime>32 || Dest::MaxRowsAtCompileTime==Dynamic)>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
509 | (GemmFunctor(lhs, rhs, dst, actualAlpha, blocking), a_lhs.rows(), a_rhs.cols(), a_lhs.cols(), Dest::Flags&RowMajorBit);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralMatrixMatrix.h:464:20: required from ‘static void Eigen::internal::generic_product_impl<Lhs, Rhs, Eigen::DenseShape, Eigen::DenseShape, 8>::subTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Lhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >]’
464 | scaleAndAddTo(dst, lhs, rhs, Scalar(-1));
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:178:42: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/GeneralBlockPanelKernel.h:2459:62: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
2459 | PacketBlock<Packet,(PacketSize%4)==0?4:PacketSize> kernel;
| ^~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1043:41: required from ‘struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >’
1043 | CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:78: required from ‘struct Eigen::internal::binary_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’
739 | CoeffReadCost = int(evaluator<Lhs>::CoeffReadCost) + int(evaluator<Rhs>::CoeffReadCost) + int(functor_traits<BinaryOp>::Cost),
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: required from ‘struct Eigen::internal::evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> > >’
722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:774:20: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:78: required from ‘struct Eigen::internal::binary_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’
739 | CoeffReadCost = int(evaluator<Lhs>::CoeffReadCost) + int(evaluator<Rhs>::CoeffReadCost) + int(functor_traits<BinaryOp>::Cost),
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: required from ‘struct Eigen::internal::evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> > >’
722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:774:20: required from ‘void Eigen::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >; Functor = sub_assign_op<double, double>]’
774 | SrcEvaluatorType srcEvaluator(src);
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment<DstXprType, SrcXprType, Functor, Eigen::internal::Dense2Dense, Weak>::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Map<Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> >; SrcXprType = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]’
954 | call_dense_assignment_loop(dst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:302:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 1>’
302 | class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:555:7: required from ‘class Eigen::DenseCoeffsBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 3>’
555 | class DenseCoeffsBase<Derived, DirectWriteAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true> >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true> >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:37:34: required from ‘class Eigen::MapBase<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>, 0>’
37 | template<typename Derived> class MapBase<Derived, ReadOnlyAccessors>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MapBase.h:223:34: [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase<Derived>&) [with Derived = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >, const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > >; Eigen::Index = long int]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl<Func, Evaluator, 3, 0>::Scalar Eigen::internal::redux_impl<Func, Evaluator, 3, 0>::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >, const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > >; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >, const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > > >; Scalar = double]’
243 | const Index alignedStart = internal::first_default_aligned(xpr);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op<double, double>; Derived = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >, const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > >; typename Eigen::internal::traits<T>::Scalar = double]’
418 | return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::sum() const [with Derived = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Map<const Eigen::Matrix<double, -1, -1, 1, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, true>, 1, -1, false> >, const Eigen::Map<const Eigen::Matrix<double, -1, 1>, 0, Eigen::Stride<0, 0> > >; typename Eigen::internal::traits<T>::Scalar = double]’
463 | return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/products/TriangularSolverVector.h:78:127: required from ‘static void Eigen::internal::triangular_solve_vector<LhsScalar, RhsScalar, Index, 1, Mode, Conjugate, 1>::run(Index, const LhsScalar*, Index, RhsScalar*) [with LhsScalar = double; RhsScalar = double; Index = long int; int Mode = 6; bool Conjugate = false]’
78 | rhs[i] -= (cjLhs.row(i).segment(s,k).transpose().cwiseProduct(Map<const Matrix<RhsScalar,Dynamic,1> >(rhs+s,k))).sum();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:73:12: required from ‘static void Eigen::internal::triangular_solver_selector<Lhs, Rhs, Side, Mode, 0, 1>::run(const Lhs&, Rhs&) [with Lhs = const Eigen::Transpose<const Eigen::Matrix<double, -1, -1> >; Rhs = Eigen::Matrix<double, -1, 1>; int Side = 1; int Mode = 6]’
71 | triangular_solve_vector<LhsScalar, RhsScalar, Index, Side, Mode, LhsProductTraits::NeedToConjugate,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
72 | (int(Lhs::Flags) & RowMajorBit) ? RowMajor : ColMajor>
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
73 | ::run(actualLhs.cols(), actualLhs.data(), actualLhs.outerStride(), actualRhs);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/SolveTriangular.h:182:21: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
654 | return internal::first_aligned<int(unpacket_traits<DefaultPacketType>::alignment),Derived>(m);
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘Eigen::Index Eigen::internal::first_default_aligned(const Eigen::DenseBase<Derived>&) [with Derived = Eigen::Block<const Eigen::CwiseUnaryOp<scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, -1, 1, true>; Eigen::Index = long int]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:243:63: required from ‘static Eigen::internal::redux_impl<Func, Evaluator, 3, 0>::Scalar Eigen::internal::redux_impl<Func, Evaluator, 3, 0>::run(const Evaluator&, const Func&, const XprType&) [with XprType = Eigen::Block<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, -1, 1, true>; Func = Eigen::internal::scalar_sum_op<double, double>; Evaluator = Eigen::internal::redux_evaluator<Eigen::Block<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, -1, 1, true> >; Scalar = double]’
243 | const Index alignedStart = internal::first_default_aligned(xpr);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op<double, double>; Derived = Eigen::Block<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, -1, 1, true>; typename Eigen::internal::traits<T>::Scalar = double]’
418 | return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func, derived());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: required from ‘typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::sum() const [with Derived = Eigen::Block<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, -1, 1, true>; typename Eigen::internal::traits<T>::Scalar = double]’
463 | return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>());
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/VectorwiseOp.h:114:1: required from ‘ResultType Eigen::internal::member_sum<ResultType, Scalar>::operator()(const XprType&) const [with XprType = Eigen::Block<const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >, -1, 1, true>; ResultType = double; Scalar = double]’
97 | { return mat.MEMBER(); } \
| ~~~~~~~~~~^~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/PartialReduxEvaluator.h:183:21: required from ‘const Eigen::internal::evaluator<Eigen::PartialReduxExpr<MatrixType, MemberOp, Direction> >::Scalar Eigen::internal::evaluator<Eigen::PartialReduxExpr<MatrixType, MemberOp, Direction> >::coeff(Eigen::Index) const [with ArgType = const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<double>, const Eigen::Matrix<double, -1, -1> >; MemberOp = Eigen::internal::member_sum<double, double>; int Direction = 0; Scalar = double; Eigen::Index = long int]’
183 | return m_functor(m_arg.template subVector<DirectionType(Direction)>(index));
| ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/PartialReduxEvaluator.h:177:17: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:654:74: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
654 | return internal::first_aligned<int(unpacket_traits<DefaultPacketType>::alignment),Derived>(m);
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true> >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:78: required from ‘struct Eigen::internal::binary_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’
739 | CoeffReadCost = int(evaluator<Lhs>::CoeffReadCost) + int(evaluator<Rhs>::CoeffReadCost) + int(functor_traits<BinaryOp>::Cost),
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: required from ‘struct Eigen::internal::evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true> > >’
722 | struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:357:7: required from ‘class Eigen::internal::redux_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true> > >’
357 | class redux_evaluator : public internal::evaluator<_XprType>
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:414:17: required from ‘typename Eigen::internal::traits<T>::Scalar Eigen::DenseBase<Derived>::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op<double, double>; Derived = Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, true> >; typename Eigen::internal::traits<T>::Scalar = double]’
414 | ThisEvaluator thisEval(derived());
| ^~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Redux.h:463:25: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:311:41: required from ‘struct Eigen::internal::unary_evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> >, Eigen::internal::IndexBased, double>’
311 | CoeffReadCost = evaluator<ArgType>::CoeffReadCost,
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator<Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> > >’
90 | struct evaluator : public unary_evaluator<T>
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:100:8: required from ‘struct Eigen::internal::evaluator<const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> > >’
100 | struct evaluator<const T>
| ^~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:739:41: required from ‘struct Eigen::internal::binary_evaluator<Eigen::CwiseBinaryOp<Eigen::internal::scalar_conj_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false>, 1, -1, true> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’
739 | CoeffReadCost = int(evaluator<Lhs>::CoeffReadCost) + int(evaluator<Rhs>::CoeffReadCost) + int(functor_traits<BinaryOp>::Cost),
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:722:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h: In instantiation of ‘class Eigen::DenseCoeffsBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> >, 0>’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:41:34: required from ‘class Eigen::DenseBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> > >’
41 | template<typename Derived> class DenseBase
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/MatrixBase.h:48:34: required from ‘class Eigen::MatrixBase<Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> > >’
48 | template<typename Derived> class MatrixBase
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:148:7: required from ‘class Eigen::CwiseBinaryOpImpl<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, Eigen::Dense>’
148 | class CwiseBinaryOpImpl
| ^~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:77:7: required from ‘class Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::Transpose<const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, 1, -1, false> >, const Eigen::Block<const Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true> >’
77 | class CwiseBinaryOp :
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:606:52: required from ‘const Eigen::internal::product_evaluator<Eigen::Product<Lhs, Rhs, 1>, ProductTag, Eigen::DenseShape, Eigen::DenseShape>::CoeffReturnType Eigen::internal::product_evaluator<Eigen::Product<Lhs, Rhs, 1>, ProductTag, Eigen::DenseShape, Eigen::DenseShape>::coeff(Eigen::Index, Eigen::Index) const [with Lhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; Rhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; int ProductTag = 8; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Lhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Lhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; typename Eigen::internal::traits<typename Eigen::Product<Lhs, Rhs, 1>::Rhs>::Scalar = double; typename Eigen::Product<Lhs, Rhs, 1>::Rhs = Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >; CoeffReturnType = double; Eigen::Index = long int]’
606 | return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:654:63: [ skipping 19 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseCoeffsBase.h:56:30: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
56 | >::type PacketReturnType;
| ^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>, -1, 1, true> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:780:20: required from ‘void Eigen::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>, -1, 1, true>; SrcXprType = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >; Functor = sub_assign_op<double, double>]’
780 | DstEvaluatorType dstEvaluator(dst);
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment<DstXprType, SrcXprType, Functor, Eigen::internal::Dense2Dense, Weak>::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>, -1, 1, true>; SrcXprType = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >; Functor = Eigen::internal::sub_assign_op<double, double>; Weak = void]’
954 | call_dense_assignment_loop(dst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49: required from ‘void Eigen::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>, -1, 1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >; Func = sub_assign_op<double, double>]’
890 | Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:858:27: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing<Src>::value), void*>::type) [with Dst = Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>, -1, 1, true>; Src = Eigen::CwiseBinaryOp<scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >; Func = sub_assign_op<double, double>; typename enable_if<(! evaluator_assume_aliasing<Src>::value), void*>::type = void*; typename evaluator_traits<SrcXprType>::Shape = Eigen::DenseShape]’
858 | call_assignment_no_alias(dst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CwiseBinaryOp.h:164:18: required from ‘Derived& Eigen::MatrixBase<Derived>::operator-=(const Eigen::MatrixBase<OtherDerived>&) [with OtherDerived = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, 1, true>, -1, 1, false> >; Derived = Eigen::Block<Eigen::Block<Eigen::Ref<Eigen::Matrix<double, -1, -1>, 0, Eigen::OuterStride<> >, -1, -1, false>, -1, 1, true>]’
164 | call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:305:153: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<const Eigen::Matrix<double, -1, 1>, 1, 1, false> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:774:20: required from ‘void Eigen::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>; SrcXprType = Eigen::Block<const Eigen::Matrix<double, -1, 1>, 1, 1, false>; Functor = assign_op<double, double>]’
774 | SrcEvaluatorType srcEvaluator(src);
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment<DstXprType, SrcXprType, Functor, Eigen::internal::Dense2Dense, Weak>::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>; SrcXprType = Eigen::Block<const Eigen::Matrix<double, -1, 1>, 1, 1, false>; Functor = Eigen::internal::assign_op<double, double>; Weak = void]’
954 | call_dense_assignment_loop(dst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49: required from ‘void Eigen::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>; Src = Eigen::Block<const Eigen::Matrix<double, -1, 1>, 1, 1, false>; Func = assign_op<double, double>]’
890 | Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:858:27: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing<Src>::value), void*>::type) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>; Src = Eigen::Block<const Eigen::Matrix<double, -1, 1>, 1, 1, false>; Func = assign_op<double, double>; typename enable_if<(! evaluator_assume_aliasing<Src>::value), void*>::type = void*; typename evaluator_traits<SrcXprType>::Shape = Eigen::DenseShape]’
858 | call_assignment_no_alias(dst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:836:18: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, 1>, 1, 1, false>; Src = Eigen::Block<const Eigen::Matrix<double, -1, 1>, 1, 1, false>]’
836 | call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>());
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/Assign.h:66:28: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::evaluator<Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true> >’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:774:20: required from ‘void Eigen::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>; SrcXprType = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>; Functor = swap_assign_op<double>]’
774 | SrcEvaluatorType srcEvaluator(src);
| ^~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:954:31: required from ‘static void Eigen::internal::Assignment<DstXprType, SrcXprType, Functor, Eigen::internal::Dense2Dense, Weak>::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>; SrcXprType = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>; Functor = Eigen::internal::swap_assign_op<double>; Weak = void]’
954 | call_dense_assignment_loop(dst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:890:49: required from ‘void Eigen::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>; Src = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>; Func = swap_assign_op<double>]’
890 | Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/AssignEvaluator.h:858:27: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing<Src>::value), void*>::type) [with Dst = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>; Src = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>; Func = swap_assign_op<double>; typename enable_if<(! evaluator_assume_aliasing<Src>::value), void*>::type = void*; typename evaluator_traits<SrcXprType>::Shape = Eigen::DenseShape]’
858 | call_assignment_no_alias(dst, src, func);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/DenseBase.h:424:22: required from ‘void Eigen::DenseBase<Derived>::swap(const Eigen::DenseBase<OtherDerived>&) [with OtherDerived = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>; Derived = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, true>]’
424 | call_assignment(derived(), other.const_cast_derived(), internal::swap_assign_op<Scalar>());
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/ProductEvaluators.h:1129:51: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
./CGAL/NewKernel_d/Kernel_d_interface.h:167:94: required from ‘CGAL::Kernel_d_interface<Base_>::FT CGAL::Kernel_d_interface<Base_>::Compute_squared_radius_d::operator()(I, I) const [with I = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Base_ = CGAL::Cartesian_wrap<CGAL::Epick_d_help3<CGAL::Dynamic_dimension_tag>, CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >; CGAL::Kernel_d_interface<Base_>::FT = double]’
167 | return typename Get_functor<Base, Squared_circumradius_tag>::type(this->kernel())(b,e);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
./gudhi/Alpha_complex/Alpha_kernel_d.h:73:53: required from ‘Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::FT Gudhi::alpha_complex::Alpha_kernel_d<Kernel, false>::get_squared_radius(PointIterator, PointIterator) const [with PointIterator = __gnu_cxx::__normal_iterator<const CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >*, std::vector<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> >, std::allocator<CGAL::Wrap::Point_d<CGAL::Epick_d<CGAL::Dynamic_dimension_tag> > > > >; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; FT = double]’
73 | return kernel_.compute_squared_radius_d_object()(begin, end);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
./gudhi/Alpha_complex.h:339:38: required from ‘auto Gudhi::alpha_complex::Alpha_complex<Kernel, Weighted>::radius(SimplicialComplexForAlpha&, typename SimplicialComplexForAlpha::Simplex_handle) [with SimplicialComplexForAlpha = Gudhi::Simplex_tree<>; Kernel = CGAL::Epick_d<CGAL::Dynamic_dimension_tag>; bool Weighted = false; typename SimplicialComplexForAlpha::Simplex_handle = boost::container::vec_iterator<std::pair<int, Gudhi::Simplex_tree_node_explicit_storage<Gudhi::Simplex_tree<> > >*, false>]’
339 | return kernel_.get_squared_radius(v.cbegin(), v.cend());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
./gudhi/Alpha_complex.h:438:43: 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]’
438 | auto const& sqrad = radius(complex, f_simplex);
| ~~~~~~^~~~~~~~~~~~~~~~~~~~
./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));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/RcppEigen/include/Eigen/src/Core/CoreEvaluators.h:1071:54: warning: ignoring attributes on template argument ‘Eigen::internal::packet_traits<double>::type’ {aka ‘__m128d’} [-Wignored-attributes]
1071 | PacketAlignment = unpacket_traits<PacketScalar>::alignment,
| ^~~~~~~~~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/include/R.h:73,
from diag.cpp:2:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include/Rcpp/exceptions/cpp11/exceptions.h: In function ‘void Rcpp::Rf_warning(const char*, Args&& ...) [with Args = {const char*}]’:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include/R_ext/Error.h:100:17: warning: infinite recursion detected [-Winfinite-recursion]
100 | #define warning Rf_warning
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include/Rcpp/exceptions/cpp11/exceptions.h:46:13: note: in expansion of macro ‘warning’
46 | inline void warning(const char* fmt, Args&&... args ) {
| ^~~~~~~
In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include/Rcpp/exceptions.h:180,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include/RcppCommon.h:130,
from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include/Rcpp.h:27,
from diag.cpp:6:
/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include/Rcpp/exceptions/cpp11/exceptions.h:47:15: note: recursive call
47 | Rf_warning("%s", tfm::format(fmt, std::forward<Args>(args)... ).c_str());
| ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
g++-14 -std=gnu++17 -shared -L/home/hornik/tmp/R.check/r-devel-gcc/Work/build/lib -Wl,-O1 -o TDA.so RcppExports.o diag.o -lgmp -L/home/hornik/tmp/R.check/r-devel-gcc/Work/build/lib -lR
make[1]: Leaving directory '/tmp/RtmpFs2iRX/R.INSTALLea03f5987b2c6/TDA/src'
make[1]: Entering directory '/tmp/RtmpFs2iRX/R.INSTALLea03f5987b2c6/TDA/src'
/bin/sh: 1: clang++: not found
expr: syntax error: unexpected argument ‘50000’
make[1]: Leaving directory '/tmp/RtmpFs2iRX/R.INSTALLea03f5987b2c6/TDA/src'
installing to /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/00LOCK-TDA/00new/TDA/libs
** R
** inst
** byte-compile and prepare package for lazy loading
** help
*** installing help indices
** building package indices
** installing vignettes
** testing if installed package can be loaded from temporary location
** checking absolute paths in shared objects and dynamic libraries
** testing if installed package can be loaded from final location
** testing if installed package keeps a record of temporary installation path
* DONE (TDA)